The following pages link to Santiago Figueira (Q235739):
Displaying 36 items.
- Completeness results for memory logics (Q408552) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Randomness and universal machines (Q864423) (← links)
- Turing's unpublished algorithm for normal numbers (Q884468) (← links)
- On the formal semantics of IF-like logics (Q980942) (← links)
- Algorithmic identification of probabilities is hard (Q1747492) (← links)
- Kolmogorov complexity for possibly infinite computations (Q1777368) (← links)
- Normality in non-integer bases and polynomial time randomness (Q2353390) (← links)
- Feasible analysis, randomness, and base invariance (Q2354578) (← links)
- Model theory of XPath on data trees. II: Binary bisimulation and definability (Q2401631) (← links)
- Axiomatizations for downward XPath on data trees (Q2402362) (← links)
- Characterization, definability and separation via saturated models (Q2453534) (← links)
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies (Q2453581) (← links)
- Lowness properties and approximations of the jump (Q2478546) (← links)
- (Q2904050) (← links)
- Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders (Q2915021) (← links)
- Definability for Downward and Vertical XPath on Data Trees (Q2938128) (← links)
- Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization (Q2941736) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- Basic Model Theory for Memory Logics (Q3003344) (← links)
- On the Expressive Power of IF-Logic with Classical Negation (Q3003355) (← links)
- Using Logic in the Generation of Referring Expressions (Q3010333) (← links)
- THE EXPRESSIVE POWER OF MEMORY LOGICS (Q3094189) (← links)
- Randomness and halting probabilities (Q3416122) (← links)
- Counting the changes of random Δ20 sets (Q3465047) (← links)
- Expressive Power and Decidability for Memory Logics (Q3511448) (← links)
- On the Formal Semantics of IF-Like Logics (Q3511456) (← links)
- Classical Computability and Fuzzy Turing Machines (Q3525756) (← links)
- Counting the Changes of Random ${\Delta^0_2}$ Sets (Q3576202) (← links)
- Completeness Results for Memory Logics (Q3605517) (← links)
- Indifferent Sets (Q3623226) (← links)
- Bisimulations on Data Graphs (Q4605201) (← links)
- Closure properties of synchronized relations (Q5090470) (← links)
- An example of a computable absolutely normal number (Q5958342) (← links)
