Pages that link to "Item:Q1256445"
From MaRDI portal
The following pages link to The computational complexity of logical theories (Q1256445):
Displaying 50 items.
- Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
- The second incompleteness theorem and bounded interpretations (Q454368) (← links)
- Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
- The most nonelementary theory (Q598194) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Knowledgebase transformations (Q676426) (← links)
- A decision algorithm for linear sentences on a PFM (Q685065) (← links)
- The unprovability of small inconsistency. A study of local and global interpretability (Q688510) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- The complexity of almost linear diophantine problems (Q753494) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems (Q804570) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- Pairs, sets and sequences in first-order theories (Q943342) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Stationary logic of ordinals (Q1062974) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- Nonconvergence, undecidability, and intractability in asymptotic problems (Q1095135) (← links)
- On the computational complexity of the theory of Abelian groups (Q1100188) (← links)
- The complexity of linear problems in fields (Q1103602) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- On time-space classes and their relation to the theory of real addition (Q1155607) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- An efficient decision procedure for the theory of rational order (Q1244341) (← links)
- Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Ehrenfeucht games and ordinal addition (Q1377635) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Linear problems in valued fields (Q1582303) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- Multitree automata that count (Q1770418) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- Fast theorem-proving and Wu's method (Q1966111) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- NP satisfiability for arrays as powers (Q2152659) (← links)
- Short proofs for slow consistency (Q2176406) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
