The following pages link to (Q4298571):
Displaying 50 items.
- Existential second-order logic and modal logic with quantified accessibility relations (Q259071) (← links)
- Bounded quantifier depth spectra for random graphs (Q267173) (← links)
- A note on the size of prenex normal forms (Q269710) (← links)
- On the zero-one \(k\)-law extensions (Q338576) (← links)
- A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
- Zero-one \(k\)-law (Q418871) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Second-order propositional modal logic and monadic alternation hierarchies (Q466445) (← links)
- Proof verification and proof discovery for relativity (Q514557) (← links)
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus (Q530864) (← links)
- Recursive definitions and fixed-points on well-founded structures (Q654910) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- The epsilon calculus and Herbrand complexity (Q817706) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- Simplifying proofs in Fitch-style natural deduction systems (Q851139) (← links)
- A first order theory of functional parthood (Q878233) (← links)
- A logical expression of reasoning (Q885515) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself (Q959049) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Logics of relative identity (Q1430993) (← links)
- On the desirability of mechanizing calculational proofs (Q1607098) (← links)
- Generalized logical consequence: Making room for induction in the logic of science (Q1610619) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- Second-order propositional modal logic: expressiveness and completeness results (Q1731834) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Some results concerning simple locally finite groups of 1-type. (Q1779368) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Learning elementary formal systems with queries. (Q1874227) (← links)
- Refuting learning revisited. (Q1874232) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- A double arity hierarchy theorem for transitive closure logic (Q1913297) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Universally defining finitely generated subrings of global fields (Q2062179) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Tableaux for free logics with descriptions (Q2142064) (← links)
- Deciding quantifier-free definability in finite algebraic structures (Q2219074) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Conjunctive query pattern structures: a relational database model for formal concept analysis (Q2286397) (← links)
- On the existence of free models in fuzzy universal Horn classes (Q2410497) (← links)
