The following pages link to Ian Pratt-Hartmann (Q464616):
Displayed 42 items.
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
- More fragments of language. (Q867399) (← links)
- Fragments of language (Q1827411) (← links)
- Elementary polyhedral mereotopology (Q1863962) (← links)
- A two-variable fragment of English (Q1868487) (← links)
- The fluted fragment with transitive relations (Q2238133) (← links)
- The Hamiltonian syllogistic (Q2255182) (← links)
- Transitivity and equivalence in decidable fragments of first-order logic: a survey (Q2284181) (← links)
- The syllogistic with unity (Q2377188) (← links)
- Data-complexity of the two-variable fragment with counting quantifiers (Q2389348) (← links)
- Temporal prepositions and their logic (Q2457655) (← links)
- Complexity of the two-variable fragment with counting quantifiers (Q2567347) (← links)
- (Q2729678) (← links)
- Spatial logics with connectedness predicates (Q2786121) (← links)
- Functions definable by numerical set-expressions (Q2844003) (← links)
- Topological Logics with Connectedness over Euclidean Spaces (Q2946698) (← links)
- (Q3085165) (← links)
- Equivalence closure in the two-variable guarded fragment (Q3133154) (← links)
- Complexity of the Guarded Two-variable Fragment with Counting Quantifiers (Q3437261) (← links)
- The two‐variable fragment with counting and equivalence (Q3460527) (← links)
- Functions Definable by Arithmetic Circuits (Q3576073) (← links)
- On the Computability of Region-Based Euclidean Logics (Q3586058) (← links)
- No Syllogisms for the Numerical Syllogistic (Q3630181) (← links)
- Conditionalization and total knowledge (Q3643315) (← links)
- A Topological Constraint Language with Component Counting (Q3647303) (← links)
- (Q4539607) (← links)
- (Q4596781) (← links)
- Logics with counting and equivalence (Q4635661) (← links)
- The Two-Variable Fragment with Counting Revisited (Q4931588) (← links)
- Adding Guarded Constructions to the Syllogistic (Q5015968) (← links)
- (Q5092377) (← links)
- Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable (Q5109226) (← links)
- Complex Algebras of Arithmetic (Q5188526) (← links)
- THE FLUTED FRAGMENT REVISITED (Q5195057) (← links)
- Two-variable First-Order Logic with Counting in Forests (Q5222957) (← links)
- (Q5278428) (← links)
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294) (← links)
- On the Computational Complexity of Spatial Logics with Connectedness Constraints (Q5505582) (← links)
- LOGICS FOR THE RELATIONAL SYLLOGISTIC (Q5850983) (← links)
- Fragments of First-Order Logic (Q5871044) (← links)
- Two-Variable First-Order Logic with Equivalence Closure (Q5892437) (← links)
- Two-Variable First-Order Logic with Equivalence Closure (Q5895185) (← links)