On the public citation graph

The Computational Complexity of Logical Theories

https://doi.org/10.1007/bfb0062837
0 signed · 189 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4158238openalex-extracted
On Collatz Theorem Ii
inferred← citeshttps://doi.org/10.1002/9781118602638.ch8openalex-snapshot
Verification of Infinite‐State Systems
inferred← citeshttps://doi.org/10.1002/malq.19880340107openalex-snapshot
First‐Order Formulas in Conjunctive Quantificational Form
inferred← citeshttps://doi.org/10.1002/malq.200910111openalex-snapshot
The quantifier complexity of polynomial‐size iterated definitions in first‐order logic
inferred← citeshttps://doi.org/10.1002/malq.202100020openalex-snapshot
The theory of hereditarily bounded sets
inferred← citeshttps://doi.org/10.1006/inco.1997.2685openalex-snapshot
A Canonical Form of Vector Machines
inferred← citeshttps://doi.org/10.1006/jcom.1995.1018openalex-snapshot
Computing over the Reals with Addition and Order: Higher Complexity Classes
inferred← citeshttps://doi.org/10.1006/jcss.1997.1454openalex-snapshot
Knowledgebase Transformations
inferred← citeshttps://doi.org/10.1006/jsco.1999.0303openalex-snapshot
Linear Problems in Valued Fields
inferred← citeshttps://doi.org/10.1007/11532231_20openalex-snapshot
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/11537311_42openalex-snapshot
The Complexity of Semilinear Problems in Succinct Representation
inferred← citeshttps://doi.org/10.1007/11563952_66openalex-snapshot
An Algebraic Framework for Schema Matching
inferred← citeshttps://doi.org/10.1007/11814771_43openalex-snapshot
Verifying Mixed Real-Integer Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_45openalex-snapshot
Logical description of computation processes
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_27openalex-snapshot
What are the gains of the theory of algorithms
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_38openalex-snapshot
Rudimentary relations and Turing machines with linear alternation
inferred← citeshttps://doi.org/10.1007/3-540-16776-5_729openalex-snapshot
Efficient decision algorithms for locally finite theories
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_41openalex-snapshot
Decidable Theories of Cayley-Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_60openalex-snapshot
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-37437-x_7openalex-snapshot
Ineffizienz und Unhandhabbarkeit
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_56openalex-snapshot
Upper Bounds for a Theory of Queues
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_50openalex-snapshot
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_77openalex-snapshot
A closed form for datalog queries with integer order
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_27openalex-snapshot
Diophantine equations, Presburger arithmetic and finite automata
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_91openalex-snapshot
An improved lower bound for the elementary theories of trees
inferred← citeshttps://doi.org/10.1007/978-1-4471-3564-7_5openalex-snapshot
Calculi for Bags and their Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4612-0125-0_5openalex-snapshot
Decidability and Completeness
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_3openalex-snapshot
Temporal Logic in Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_15openalex-snapshot
NP Satisfiability for Arrays as Powers
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_42openalex-snapshot
Linear Integer Arithmetic Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_33openalex-snapshot
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_9openalex-snapshot
Decision Procedures for Recursive Data Structures with Integer Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_23openalex-snapshot
Term Algebras with Length Function and Bounded Quantifier Alternation
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_25openalex-snapshot
Automatic Structures of Bounded Degree
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_78openalex-snapshot
Model Theory Makes Formulas Large
inferred← citeshttps://doi.org/10.1007/978-3-540-75187-8_22openalex-snapshot
Weak Integer Quantifier Elimination Beyond the Linear Case
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_31openalex-snapshot
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_34openalex-snapshot
A Generalization of Semenov’s Theorem to Automata over Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_35openalex-snapshot
Model Checking FO(R) over One-Counter Processes and beyond
inferred← citeshttps://doi.org/10.1007/978-3-642-04103-7_18openalex-snapshot
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_22openalex-snapshot
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_7openalex-snapshot
Inefficiency and Intractability
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-56666-0_12openalex-snapshot
Parametric Systems of Linear Congruences
inferred← citeshttps://doi.org/10.1007/978-3-642-75462-3_3openalex-snapshot
Weak Formal Theories of Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_24openalex-snapshot
On Presburger Arithmetic Extended with Modulo Counting Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-7091-9461-4_5openalex-snapshot
On the lengths of proofs of consistency
inferred← citeshttps://doi.org/10.1007/978-88-470-0580-8_18openalex-snapshot
Note bibliografiche
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_10openalex-snapshot
Laws in Logic and Combinatorics
inferred← citeshttps://doi.org/10.1007/bf01387407openalex-snapshot
The unprovability of small inconsistency
inferred← citeshttps://doi.org/10.1007/bf02679468openalex-snapshot
Complexity of presburger arithmetic with fixed quantifier dimension
inferred← citeshttps://doi.org/10.1007/bf02948789openalex-snapshot
Fast theorem-proving and Wu’s Method
inferred← citeshttps://doi.org/10.1007/bfb0027788openalex-snapshot
On the bounded theories of finite trees
inferred← citeshttps://doi.org/10.1007/bfb0035010openalex-snapshot
Constraint databases: A survey
inferred← citeshttps://doi.org/10.1007/bfb0095666openalex-snapshot
Borne superieure de la complexite de la theorie de ℕ muni de la relation de divisibilite
inferred← citeshttps://doi.org/10.1007/s00037-006-0213-6openalex-snapshot
The complexity of semilinear problems in succinct representation
inferred← citeshttps://doi.org/10.1007/s00153-006-0031-1openalex-snapshot
Computational complexity of logical theories of one successor and another unary function
inferred← citeshttps://doi.org/10.1007/s00153-008-0087-1openalex-snapshot
Pairs, sets and sequences in first-order theories
inferred← citeshttps://doi.org/10.1007/s00200-007-0053-xopenalex-snapshot
Weak quantifier elimination for the full linear theory of the integers
inferred← citeshttps://doi.org/10.1007/s00236-022-00424-2openalex-snapshot
Alternating complexity of counting first-order logic for the subword order
inferred← citeshttps://doi.org/10.1007/s10009-011-0217-7openalex-snapshot
Functional synthesis for linear arithmetic and sets
inferred← citeshttps://doi.org/10.1007/s10703-017-0290-yopenalex-snapshot
Solving quantified linear arithmetic by counterexample-guided instantiation
inferred← citeshttps://doi.org/10.1007/s10817-004-6241-5openalex-snapshot
Model-Theoretic Methods in Combined Constraint Satisfiability
inferred← citeshttps://doi.org/10.1007/s10817-006-9042-1openalex-snapshot
Deciding Boolean Algebra with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot
Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1007/s11225-012-9385-zopenalex-snapshot
The Second Incompleteness Theorem and Bounded Interpretations
inferred← citeshttps://doi.org/10.1016/0001-8708(82)90048-2openalex-snapshot
The complexity of the word problems for commutative semigroups and polynomial ideals
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90166-3openalex-snapshot
On the definability of properties of finite graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90076-6openalex-snapshot
Real addition and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1016/0168-0072(84)90040-xopenalex-snapshot
Stationary logic of ordinals
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90017-0openalex-snapshot
Nonconvergence, undecidability, and intractability in asymptotic problems
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90023-7openalex-snapshot
Dominoes and the complexity of subclasses of logical theories
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90080-lopenalex-snapshot
A uniform method for proving lower bounds on the computational complexity of logical theories
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90097-wopenalex-snapshot
A decision algorithm for linear sentences on a PFM
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90036-5openalex-snapshot
On time-space classes and their relation to the theory of real addition
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90038-5openalex-snapshot
Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90074-xopenalex-snapshot
On the complexity of theories of permutations
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90136-3openalex-snapshot
Subclasses of presburger arithmetic and the polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90272-4openalex-snapshot
New formally undecidable propositions: non-trivial lower bounds on proof complexity and related theorems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90250-jopenalex-snapshot
Complexity of logical theories involving coprimality
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90222-fopenalex-snapshot
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90060-uopenalex-snapshot
A logic for reasoning about probabilities
inferred← citeshttps://doi.org/10.1016/b978-0-12-800160-8.00005-xopenalex-snapshot
Classifying Problems into Complexity Classes
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.002openalex-snapshot
Logical aspects of Cayley-graphs: the group case
inferred← citeshttps://doi.org/10.1016/j.ic.2004.02.002openalex-snapshot
The most nonelementary theory
inferred← citeshttps://doi.org/10.1016/j.ic.2010.07.003openalex-snapshot
Ehrenfeucht–Fraïssé goes automatic for real addition
inferred← citeshttps://doi.org/10.1016/j.jal.2011.09.002openalex-snapshot
Locality and modular Ehrenfeucht–Fraïssé games
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100906openalex-snapshot
On algebraic array theories
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.100978openalex-snapshot
Succinct ordering and aggregation constraints in algebraic array theories
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.021openalex-snapshot
A complete and terminating approach to linear integer solving
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.024openalex-snapshot
On the complexity of decision using destinies in H-bounded structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.023openalex-snapshot
Multitree automata that count
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.005openalex-snapshot
Quantifier elimination for the reals with a predicate for the powers of two
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.025openalex-snapshot
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80047-9openalex-snapshot
The impact of model theory on theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70460-9openalex-snapshot
Twenty Years of P-Adic Model Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70462-2openalex-snapshot
On the length of proofs of finitistic consistency statements in first order theories
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71820-2openalex-snapshot
Decision Problems in Predicate Logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80023-2openalex-snapshot
The Lengths of Proofs
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00005-5openalex-snapshot
Ehrenfeucht games and ordinal addition
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00109-2openalex-snapshot
Decidability of the theory of the natural integers with the cantor pairing function and the successor
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00314-1openalex-snapshot
On iterating linear transformations over recognizable sets of integers
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00124-7openalex-snapshot
The complexity of query evaluation in indefinite temporal constraint databases
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00194-6openalex-snapshot
Queries with arithmetical constraints
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00039-xopenalex-snapshot
Fixed point characterization of infinite behavior of finite-state systems
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80051-xopenalex-snapshot
The complexity of almost linear diophantine problems
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80003-8openalex-snapshot
The complexity of linear problems in fields
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80016-6openalex-snapshot
A bibliography of quantifier elimination for real closed fields
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00085-3openalex-snapshot
Skolem functions of arithmetical sentences
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80022-xopenalex-snapshot
19 Applications of modal logic in linguistics
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80650-9openalex-snapshot
Quantifier Elimination and Provers Integration
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1017/jsl.2015.4openalex-snapshot
PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
inferred← citeshttps://doi.org/10.1017/s0022481200028905openalex-snapshot
Alfred Tarski and decidable theories
inferred← citeshttps://doi.org/10.1017/s1755020316000198openalex-snapshot
VON NEUMANN’S CONSISTENCY PROOF
inferred← citeshttps://doi.org/10.1023/a:1020043517392openalex-snapshot
Querying Temporal Constraint Networks: A Unifying Approach
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0742421-9openalex-snapshot
Complexity of Subcases of Presburger Arithmetic
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1093/oso/9780198537816.003.0006openalex-snapshot
A uniform method for proving lower bounds on the computational complexity of logical theories
inferred← citeshttps://doi.org/10.1109/21.23091openalex-snapshot
The limits and capabilities of machines-a review
inferred← citeshttps://doi.org/10.1109/69.683757openalex-snapshot
Temporal semantic assumptions and their use in databases
inferred← citeshttps://doi.org/10.1109/dac.1995.250007openalex-snapshot
Equivalence Checking of Datapaths Based on Canonical Arithmetic Expressions
inferred← citeshttps://doi.org/10.1109/date.2009.5090878openalex-snapshot
Using dynamic compilation for continuing execution under reduced memory availability
inferred← citeshttps://doi.org/10.1109/lics.2000.855776openalex-snapshot
A decision procedure for term algebras with queues
inferred← citeshttps://doi.org/10.1109/lics.2003.1210049openalex-snapshot
Structural subtyping of non-recursive types is decidable
inferred← citeshttps://doi.org/10.1109/lics.2004.1319605openalex-snapshot
On the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1109/lics.2017.8005141openalex-snapshot
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
inferred← citeshttps://doi.org/10.1109/tvlsi.2006.878471openalex-snapshot
Expression equivalence checking using interval analysis
inferred← citeshttps://doi.org/10.1112/blms.12708openalex-snapshot
Finitely axiomatized theories lack self‐comprehension
inferred← citeshttps://doi.org/10.1137/0211050openalex-snapshot
On Some Deterministic Space Complexity Problems
inferred← citeshttps://doi.org/10.1137/0213054openalex-snapshot
Cylindrical Algebraic Decomposition I: The Basic Algorithm
inferred← citeshttps://doi.org/10.1137/0213055openalex-snapshot
Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane
inferred← citeshttps://doi.org/10.1142/s0218196706003001openalex-snapshot
LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
inferred← citeshttps://doi.org/10.1145/1071596.1071601openalex-snapshot
An effective decision procedure for linear arithmetic over the integers and reals
inferred← citeshttps://doi.org/10.1145/1081706.1081740openalex-snapshot
Relational analysis of algebraic datatypes
inferred← citeshttps://doi.org/10.1145/1086297.1086317openalex-snapshot
Equivalence checking of arithmetic expressions using fast evaluation
inferred← citeshttps://doi.org/10.1145/1095430.1081740openalex-snapshot
Relational analysis of algebraic datatypes
inferred← citeshttps://doi.org/10.1145/1283920.1283938openalex-snapshot
An overview of computational complexity
inferred← citeshttps://doi.org/10.1145/1342991.1342995openalex-snapshot
Bounds on the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/1806596.1806632openalex-snapshot
Complete functional synthesis
inferred← citeshttps://doi.org/10.1145/1809028.1806632openalex-snapshot
Complete functional synthesis
inferred← citeshttps://doi.org/10.1145/2076450.2076472openalex-snapshot
Software synthesis procedures
inferred← citeshttps://doi.org/10.1145/23005.24037openalex-snapshot
Decidability of the purely existential fragment of the theory of term algebras
inferred← citeshttps://doi.org/10.1145/2480759.2480760openalex-snapshot
First-Order Logic on Higher-Order Nested Pushdown Trees
inferred← citeshttps://doi.org/10.1145/258726.258746openalex-snapshot
Complexity and uniformity of elimination in Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/2603088.2603095openalex-snapshot
KAT + B!
inferred← citeshttps://doi.org/10.1145/275487.275515openalex-snapshot
Complexity of nonrecursive logic programs with complex values
inferred← citeshttps://doi.org/10.1145/3009837.3009887openalex-snapshot
Coming to terms with quantified reasoning
inferred← citeshttps://doi.org/10.1145/3093333.3009887openalex-snapshot
Coming to terms with quantified reasoning
inferred← citeshttps://doi.org/10.1145/309831.309894openalex-snapshot
P-adic constraint solving
inferred← citeshttps://doi.org/10.1145/335168.335218openalex-snapshot
Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)
inferred← citeshttps://doi.org/10.1145/358141.358144openalex-snapshot
An overview of computational complexity
inferred← citeshttps://doi.org/10.1145/371316.371494openalex-snapshot
A decision procedure for term algebras with queues
inferred← citeshttps://doi.org/10.1145/3820035openalex-snapshot
Convex and Reverse Convex Prequadratics Constraints for Decidable Logics of Relations with Cardinalities
inferred← citeshttps://doi.org/10.1145/773153.773169openalex-snapshot
Numerical document queries
inferred← citeshttps://doi.org/10.1145/800133.804352openalex-snapshot
On time-space classes and their relation to the theory of real addition
inferred← citeshttps://doi.org/10.1145/800141.804679openalex-snapshot
On some deterministic space complexity problems
inferred← citeshttps://doi.org/10.1147/rd.254.0327openalex-snapshot
Positive First-Order Logic Is NP-Complete
inferred← citeshttps://doi.org/10.1215/00294527-2019-0031openalex-snapshot
Short Proofs for Slow Consistency
inferred← citeshttps://doi.org/10.2178/bsl/1344861888openalex-snapshot
Vaught's Theorem on Axiomatizability by a Scheme
inferred← citeshttps://doi.org/10.2178/jsl/1146620150openalex-snapshot
Complexity, decidability and completeness
inferred← citeshttps://doi.org/10.2178/jsl/1294170991openalex-snapshot
Double-exponential inseparability of Robinson subsystem Q+
inferred← citeshttps://doi.org/10.2178/jsl/1333566644openalex-snapshot
Sharpened lower bounds for cut elimination
inferred← citeshttps://doi.org/10.21825/philosophica.82598openalex-snapshot
Pragmatics and Mathematics or how do mathematicians talk ?
inferred← citeshttps://doi.org/10.2307/2273858openalex-snapshot
Classifying the computational complexity of problems
inferred← citeshttps://doi.org/10.2307/2275444openalex-snapshot
On decidable varieties of Heyting algebras
inferred← citeshttps://doi.org/10.2307/2275735openalex-snapshot
The theory of integer multiplication with order restricted to primes is decidable
inferred← citeshttps://doi.org/10.2307/2275908openalex-snapshot
A small reflection principle for bounded arithmetic
inferred← citeshttps://doi.org/10.24963/ijcai.2019/5openalex-snapshot
Probabilistic Strategy Logic
inferred← citeshttps://doi.org/10.31274/rtd-180813-10619openalex-snapshot
On the structure of intractable sets
inferred← citeshttps://doi.org/10.3280/rip2022oa16047openalex-snapshot
Nuovi paradigmi e i disturbi del neurosviluppo: le linee di cambiamento che emergono dal dibattito
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.242openalex-snapshot
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:4)2023openalex-snapshot
On Presburger arithmetic extended with non-unary counting quantifiers
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1980openalex-snapshot
First-Order Logic on Higher-Order Nested Pushdown Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1196openalex-snapshot
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04181openalex-snapshot
Constraint Satisfaction Problems around Skolem Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02642openalex-snapshot
An Instantiation-Based Approach for Solving Quantified Linear Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0303019openalex-snapshot
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0408015openalex-snapshot
On the Theory of Structural Subtyping
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610117openalex-snapshot
Quantifier elimination for the reals with a predicate for the powers of two
inferred← citeshttps://doi.org/10.5555/1874620.1874950openalex-snapshot
Using dynamic compilation for continuing execution under reduced memory availability
inferred← citeshttps://doi.org/10.70675/4a3d121bzbb9az47ebzb688z4c3e0339c01bopenalex-snapshot
On Effective Representations of Well Quasi-Orderings
inferred← citeshttps://doi.org/10.7202/027258aropenalex-snapshot
« De la logique interne ». Yvon Gauthier, De la logique interne, Paris, Librairie philosophique J. Vrin, collection Mathesis, 1991, 140 p.
inferred← citeshttps://doi.org/10.7202/027335aropenalex-snapshot
Yvon Gauthier, De la logique interne, Paris, Librairie philosophique J. Vrin, collection Mathesis, 1991, 140 pages.
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.