The following pages link to Carlos Areces (Q190282):
Displaying 50 items.
- Completeness results for memory logics (Q408552) (← links)
- Completeness in hybrid type theory (Q484101) (← links)
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) (Q631075) (← links)
- Symmetric blocking (Q897931) (← links)
- Repairing the interpolation theorem in quantified modal logic (Q1412840) (← links)
- Undecidability of relation-changing modal logics (Q1742616) (← links)
- Deciding open definability via subisomorphisms (Q1799273) (← links)
- Analyzing the core of categorial grammar (Q1827401) (← links)
- Default modal systems as algebraic updates (Q2055757) (← links)
- Interpolation and Beth definability in default logics (Q2296753) (← links)
- A tableaux calculus for default intuitionistic logic (Q2305412) (← links)
- The modal logic of copy and remove (Q2401633) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- Characterization, definability and separation via saturated models (Q2453534) (← links)
- Hybrid logics: Characterization, interpolation and complexity (Q2758042) (← links)
- Bringing them all together (Q2772879) (← links)
- Resolution in modal, description and hybrid logic (Q2772883) (← links)
- Characterization results for d-Horn formulas, or on formulas that are true on dual reduced products (Q2776457) (← links)
- Unsorted functional translations (Q2825403) (← links)
- Hilbert-Style Axiomatization for Hybrid XPath with Data (Q2835860) (← links)
- Tableaux for Relation-Changing Modal Logics (Q2849494) (← links)
- Dealing with Symmetries in Modal Tableaux (Q2851930) (← links)
- Moving Arrows and Four Model Checking Results (Q2915023) (← links)
- Logics with Copy and Remove (Q2938130) (← links)
- Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization (Q2941736) (← links)
- Basic Model Theory for Memory Logics (Q3003344) (← links)
- (Q3007241) (← links)
- Using Logic in the Generation of Referring Expressions (Q3010333) (← links)
- THE EXPRESSIVE POWER OF MEMORY LOGICS (Q3094189) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
- The complexity of definability by open first-order formulas (Q3386916) (← links)
- Expressive Power and Decidability for Memory Logics (Q3511448) (← links)
- Completeness Results for Memory Logics (Q3605517) (← links)
- Tableaux and Model Checking for Memory Logics (Q3648720) (← links)
- (Q4263164) (← links)
- (Q4430391) (← links)
- The computational complexity of hybrid temporal logics (Q4511543) (← links)
- (Q4546706) (← links)
- The lattice of congruences of a finite line frame (Q4555460) (← links)
- Satisfiability for relation-changing logics (Q4612446) (← links)
- Relation-changing modal operators: Fig. 1. (Q4644524) (← links)
- (Q4809053) (← links)
- Galois Connections in Categorial Type Logic (Q4923551) (← links)
- Modal Logics with Counting (Q4931593) (← links)
- (Q4945233) (← links)
- Experiments in Theorem Proving for Topological Hybrid Logic (Q4982128) (← links)
- (Q4992392) (← links)
- (Q5015266) (← links)
- (Q5018505) (← links)
- (Q5141772) (← links)
