 | 2012 |
| 25 |  | Carlos Areces,
Santiago Figueira,
Sergio Mera:
Completeness results for memory logics.
Ann. Pure Appl. Logic 163(7): 961-972 (2012) |
| 2011 |
| 24 |  | Carlos Areces,
Santiago Figueira,
Daniel Gorín:
Using Logic in the Generation of Referring Expressions.
LACL 2011: 17-32 |
| 23 |  | Diego Figueira,
Santiago Figueira,
Sylvain Schmitz,
Philippe Schnoebelen:
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.
LICS 2011: 269-278 |
| 22 |  | Santiago Figueira,
Daniel Gorín,
Rafael Grimson:
On the Expressive Power of IF-Logic with Classical Negation.
WoLLIC 2011: 135-145 |
| 21 |  | Carlos Areces,
Facundo Carreiro,
Santiago Figueira,
Sergio Mera:
Basic Model Theory for Memory Logics.
WoLLIC 2011: 20-34 |
| 2010 |
| 20 |  | Santiago Figueira,
Daniel Gorín:
On the Size of Shortest Modal Descriptions.
Advances in Modal Logic 2010: 120-139 |
| 19 |  | Santiago Figueira,
Denis R. Hirschfeldt,
Joseph S. Miller,
Keng Meng Ng,
André Nies:
Counting the Changes of Random D02{\Delta^0_2} Sets.
CiE 2010: 162-171 |
| 18 |  | Carlos Areces,
Santiago Figueira,
Daniel Gorín:
The Question of Expressiveness in the Generation of Referring Expressions
CoRR abs/1006.4621: (2010) |
| 17 |  | Diego Figueira,
Santiago Figueira,
Sylvain Schmitz,
Philippe Schnoebelen:
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma
CoRR abs/1007.2989: (2010) |
| 16 |  | Santiago Figueira,
Daniel Gorín,
Rafael Grimson:
On the formal semantics of IF-like logics.
J. Comput. Syst. Sci. 76(5): 333-346 (2010) |
| 2009 |
| 15 |  | Carlos Areces,
Santiago Figueira,
Sergio Mera:
Completeness Results for Memory Logics.
LFCS 2009: 16-30 |
| 14 |  | Santiago Figueira,
Joseph S. Miller,
André Nies:
Indifferent Sets.
J. Log. Comput. 19(2): 425-443 (2009) |
| 2008 |
| 13 |  | Santiago Figueira,
Daniel Gorín,
Rafael Grimson:
On the Formal Semantics of IF-Like Logics.
WoLLIC 2008: 164-178 |
| 12 |  | Carlos Areces,
Diego Figueira,
Santiago Figueira,
Sergio Mera:
Expressive Power and Decidability for Memory Logics.
WoLLIC 2008: 56-68 |
| 11 |  | Santiago Figueira,
André Nies,
Frank Stephan:
Lowness properties and approximations of the jump.
Ann. Pure Appl. Logic 152(1-3): 51-66 (2008) |
| 10 |  | Benjamín René Callejas Bedregal,
Santiago Figueira:
On the computing power of fuzzy Turing machines.
Fuzzy Sets and Systems 159(9): 1072-1083 (2008) |
| 2007 |
| 9 |  | Verónica Becher,
Santiago Figueira,
Rafael Picchi:
Turing's unpublished algorithm for normal numbers.
Theor. Comput. Sci. 377(1-3): 126-138 (2007) |
| 2006 |
| 8 |  | Benjamín René Callejas Bedregal,
Santiago Figueira:
Classical Computability and Fuzzy Turing Machines.
LATIN 2006: 154-165 |
| 7 |  | Santiago Figueira,
André Nies,
Frank Stephan:
Lowness Properties and Approximations of the Jump.
Electr. Notes Theor. Comput. Sci. 143: 45-57 (2006) |
| 6 |  | Santiago Figueira,
Frank Stephan,
Guohua Wu:
Randomness and universal machines.
J. Complexity 22(6): 738-751 (2006) |
| 5 |  | Verónica Becher,
Santiago Figueira,
Serge Grigorieff,
Joseph S. Miller:
Randomness and halting probabilities.
J. Symb. Log. 71(4): 1411-1430 (2006) |
| 2005 |
| 4 |  | Santiago Figueira,
Frank Stephan,
Guohua Wu:
Randomness and Universal Machines.
CCA 2005: 103-116 |
| 3 |  | Verónica Becher,
Santiago Figueira:
Kolmogorov Complexity for Possibly Infinite Computations.
Journal of Logic, Language and Information 14(2): 133-148 (2005) |
| 2 |  | Verónica Becher,
Santiago Figueira,
André Nies,
Silvana Picchi:
Program Size Complexity for Possibly Infinite Computations.
Notre Dame Journal of Formal Logic 46(1): 51-64 (2005) |
| 2002 |
| 1 |  | Verónica Becher,
Santiago Figueira:
An example of a computable absolutely normal number.
Theor. Comput. Sci. 270(1-2): 947-958 (2002) |