Pages that link to "Item:Q1256445"
From MaRDI portal
The following pages link to The computational complexity of logical theories (Q1256445):
Displayed 34 items.
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- Vaught's Theorem on Axiomatizability by a Scheme (Q2915888) (← links)
- The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290) (← links)
- Double-exponential inseparability of Robinson subsystem <i>Q</i><sub>+</sub> (Q3083130) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- Complexity of Subcases of Presburger Arithmetic (Q3340842) (← links)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
- Halting and Equivalence of Program Schemes in Models of Arbitrary Theories (Q3586015) (← links)
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Strong reducibilities (Q3942949) (← links)
- On decidable varieties of Heyting algebras (Q4032876) (← links)
- A small reflection principle for bounded arithmetic (Q4314671) (← links)
- The theory of integer multiplication with order restricted to primes is decidable (Q4338318) (← links)
- An improved lower bound for the elementary theories of trees (Q4647523) (← links)
- Quantifier Elimination and Provers Integration (Q4916219) (← links)
- (Q5079723) (← links)
- (Q5089232) (← links)
- (Q5090942) (← links)
- Uniformly Automatic Classes of Finite Structures (Q5090943) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- Truth definition for $\Delta _ 0$ formulas and PSPACE computations (Q5146427) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)
- VON NEUMANN’S CONSISTENCY PROOF (Q5737949) (← links)
- Diophantine equations, Presburger arithmetic and finite automata (Q5878899) (← links)
- Decidability of the theory of the natural integers with the Cantor pairing function and the successor (Q5941253) (← links)
- Finitely axiomatized theories lack self‐comprehension (Q6051417) (← links)
- The theory of hereditarily bounded sets (Q6094150) (← links)
- On Presburger arithmetic extended with non-unary counting quantifiers (Q6135772) (← links)
- On algebraic array theories (Q6192058) (← links)