An example of a computable absolutely normal number. - Verónica Becher; Santiago Figueira (Theor. Comput. Sci., 2002)

Lowness Properties and Approximations of the Jump. - Santiago Figueira; André Nies; Frank Stephan 001 (WoLLIC, 2005)

Kolmogorov Complexity for Possibly Infinite Computations. - Verónica Becher; Santiago Figueira (J. Log. Lang. Inf., 2005)

Program Size Complexity for Possibly Infinite Computations. - Verónica Becher; Santiago Figueira; André Nies; Silvana Picchi (Notre Dame J. Formal Log., 2005)

Classical Computability and Fuzzy Turing Machines. - Benjamín René Callejas Bedregal; Santiago Figueira (LATIN, 2006)

Randomness and universal machines. - Santiago Figueira; Frank Stephan 001; Guohua Wu (J. Complex., 2006)

Randomness and halting probabilities. - Verónica Becher; Santiago Figueira; Serge Grigorieff; Joseph S. Miller (J. Symb. Log., 2006)

Aspectos de aleatoriedad - Santiago Figueira (2006)

Turing's unpublished algorithm for normal numbers. - Verónica Becher; Santiago Figueira; Rafael Picchi (Theor. Comput. Sci., 2007)

Expressive Power and Decidability for Memory Logics. - Carlos Areces; Diego Figueira; Santiago Figueira; Sergio Mera (WoLLIC, 2008)

On the computing power of fuzzy Turing machines. - Benjamín René Callejas Bedregal; Santiago Figueira (Fuzzy Sets Syst., 2008)

Indifferent Sets. - Santiago Figueira; Joseph S. Miller; André Nies (J. Log. Comput., 2009)

On the Size of Shortest Modal Descriptions. - Santiago Figueira; Daniel Gorín (Advances in Modal Logic, 2010)

Counting the Changes of Random D02 Sets. - Santiago Figueira; Denis R. Hirschfeldt; Joseph S. Miller; Keng Meng Ng; André Nies (CiE, 2010)

The Question of Expressiveness in the Generation of Referring Expressions - Carlos Areces; Santiago Figueira; Daniel Gorín (CoRR, 2010)

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma - Diego Figueira; Santiago Figueira; Sylvain Schmitz; Philippe Schnoebelen (CoRR, 2010)

On the formal semantics of IF-like logics. - Santiago Figueira; Daniel Gorín; Rafael Grimson (J. Comput. Syst. Sci., 2010)

Using Logic in the Generation of Referring Expressions. - Carlos Areces; Santiago Figueira; Daniel Gorín (LACL, 2011)

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. - Diego Figueira; Santiago Figueira; Sylvain Schmitz; Philippe Schnoebelen (LICS, 2011)

Basic Model Theory for Memory Logics. - Carlos Areces; Facundo Carreiro; Santiago Figueira; Sergio Mera (WoLLIC, 2011)

On the Expressive Power of IF-Logic with Classical Negation. - Santiago Figueira; Daniel Gorín; Rafael Grimson (WoLLIC, 2011)

The Expressive Power of Memory Logics. - Carlos Areces; Diego Figueira; Santiago Figueira; Sergio Mera (Rev. Symb. Log., 2011)

Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders. - Sergio Abriola; Santiago Figueira; Gabriel Senno (WoLLIC, 2012)

Completeness results for memory logics. - Carlos Areces; Santiago Figueira; Sergio Mera (Ann. Pure Appl. Log., 2012)

LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity - Sergio Romano; Mariano Sigman; Santiago Figueira (CoRR, 2013)

A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings. - Sergio Abriola; Santiago Figueira (CLEI, 2014)

Basic Model Theory of XPath on Data Trees. - Diego Figueira; Santiago Figueira; Carlos Areces (ICDT, 2014)

Definability for Downward and Vertical XPath on Data Trees. - Sergio Abriola; María Emilia Descotte; Santiago Figueira (WoLLIC, 2014)

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies. - Santiago Figueira; Daniel Gorín; Rafael Grimson (J. Comput. Syst. Sci., 2014)

Characterization, definability and separation via saturated models. - Carlos Areces; Facundo Carreiro; Santiago Figueira (Theor. Comput. Sci., 2014)

Saturation, Definability, and Separation for XPath on Data Trees. - Sergio Abriola; María Emilia Descotte; Santiago Figueira (AMW, 2015)

Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization. - Diego Figueira; Santiago Figueira; Carlos Areces (J. Artif. Intell. Res., 2015)

Normality in non-integer bases and polynomial time randomness. - Javier Ignacio Almarza; Santiago Figueira (J. Comput. Syst. Sci., 2015)

Counting the changes of random Δ20 sets. - Santiago Figueira; Denis R. Hirschfeldt; Joseph S. Miller; Keng Meng Ng; André Nies (J. Log. Comput., 2015)

Feasible Analysis, Randomness, and Base Invariance. - Santiago Figueira; André Nies (Theory Comput. Syst., 2015)

Linearizing well quasi-orders and bounding the length of bad sequences. - Sergio Abriola; Santiago Figueira; Gabriel Senno (Theor. Comput. Sci., 2015)

Logics of Repeating Values on Data Trees and Branching Counter Systems. - Sergio Abriola; Diego Figueira; Santiago Figueira (FoSSaCS, 2017)

Model theory of XPath on data trees. Part II: Binary bisimulation and definability. - Sergio Abriola; María Emilia Descotte; Santiago Figueira (Inf. Comput., 2017)

Axiomatizations for downward XPath on data trees. - Sergio Abriola; María Emilia Descotte; Raul Fervari; Santiago Figueira (J. Comput. Syst. Sci., 2017)

The language of geometry: Fast comprehension of geometrical primitives and rules in human adults and preschoolers. - Marie Amalric; Liping Wang; Pierre Pica; Santiago Figueira; Mariano Sigman; Stanislas Dehaene (PLoS Comput. Biol., 2017)

Learning is Compiling: Experience Shapes Concept Learning by Combining Primitives in a Language of Thought. - Pablo Tano; Sergio Romano; Mariano Sigman; Alejo Salles; Santiago Figueira (CoRR, 2018)

Bisimulations on Data Graphs. - Sergio Abriola; Pablo Barceló; Diego Figueira; Santiago Figueira (J. Artif. Intell. Res., 2018)

Algorithmic identification of probabilities is hard. - Laurent Bienvenu; Santiago Figueira; Benoit Monin; Alexander Shen 001 (J. Comput. Syst. Sci., 2018)

Closure Properties of Synchronized Relations. - María Emilia Descotte; Diego Figueira; Santiago Figueira (STACS, 2019)

Representation of spatial sequences using nested rules in human prefrontal cortex. - Liping Wang; Marie Amalric; Wen Fang; Xinjian Jiang; Christophe Pallier; Santiago Figueira; Mariano Sigman; Stanislas Dehaene (NeuroImage, 2019)

Finite Controllability for Ontology-Mediated Query Answering of CRPQ. - Diego Figueira; Santiago Figueira; Edwin Pin Baque (KR, 2020)

A theory of memory for binary sequences: Evidence for a mental compression algorithm in humans. - Samuel Planton; Timo van Kerkoerle; Leïla Abbih; Maxime Maheu; Florent Meyniel; Mariano Sigman; Liping Wang; Santiago Figueira; Sergio Romano; Stanislas Dehaene (PLoS Comput. Biol., 2021)

PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse. - Diego Figueira; Santiago Figueira; Edwin Pin Baque (LICS, 2023)

A Modal Logic with n-ary Relations Over Paths: Comonadic Semantics and Expressivity. - Santiago Figueira; Gabriel Goren Roig (CoRR, 2023)

Rauzy dimension and finite-state dimension. - Verónica Becher; Olivier Carton; Santiago Figueira (CoRR, 2024)

Rauzy complexity and block entropy. - Verónica Becher; Olivier Carton; Santiago Figueira (Inf. Comput., 2025)

Modal logic with relations over paths: A theoretical development through comonadic semantics. - Santiago Figueira; Gabriel Goren Roig (J. Log. Comput., 2025)

A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order. - Diego Figueira; Santiago Figueira (CoRR, 2025)

Axiomatization of XPath with general data comparison. - Sergio Abriola; Santiago Figueira; Nicolás González (J. Appl. Non Class. Logics, 2025)

Algorithms to prove the maximum number of MUBs in arbitrary dimension. - Santiago Cifuentes; Nicolás Ciancaglini; Guido Bellomo; Santiago Figueira; Ariel Bendersky (Quantum Inf. Process., 2025)