On the public citation graph

Toward logic tailored for computational complexity

https://doi.org/10.1007/bfb0099486
0 signed · 274 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19750210112openalex-snapshot
Monadic generalized spectra
inferredcites →https://doi.org/10.1007/3-540-13331-3_50openalex-snapshot
Spektralproblem and completeness of logical decision problems
inferredcites →https://doi.org/10.1007/bf01071084openalex-snapshot
Range and degree of realizability of formulas in the restricted predicate calculus
inferredcites →https://doi.org/10.1007/bf02297651openalex-snapshot
Existential interpretation. II
inferredcites →https://doi.org/10.1016/0001-8708(76)90167-5openalex-snapshot
The complexity of explicit definitions
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(84)80062-5openalex-snapshot
A logic for constant-depth circuits
inferredcites →https://doi.org/10.1016/s0049-237x(08)71822-6openalex-snapshot
NP and Craig's Interpolation Theorem
inferredcites →https://doi.org/10.1017/cbo9781139171496.014openalex-snapshot
Complexity of computation
inferredcites →https://doi.org/10.1017/s0022481200051513openalex-snapshot
The decision problem for standard classes
inferredcites →https://doi.org/10.1090/s0273-0979-1984-15207-8openalex-snapshot
The Gödel class with identity is unsolvable
inferredcites →https://doi.org/10.1090/trans2/023/01openalex-snapshot
Impossibility of an algorithm for the decision problem in finite classes
inferredcites →https://doi.org/10.1109/sfcs.1983.5openalex-snapshot
Algebras of feasible functions
inferredcites →https://doi.org/10.1111/j.1755-2567.1969.tb00356.xopenalex-snapshot
On Extensions of Elementary Logic
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/567752.567763openalex-snapshot
Universality of data retrieval languages
inferredcites →https://doi.org/10.1145/800061.808765openalex-snapshot
Languages which capture complexity classes
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/800070.802187openalex-snapshot
Relational queries computable in polynomial time (Extended Abstract)
inferredcites →https://doi.org/10.1147/sj.164.0324openalex-snapshot
Query-by-Example: A data base language
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2307/2272354openalex-snapshot
Turing machines and the spectra of first-order formulas
inferredcites →https://doi.org/10.2307/2963593openalex-snapshot
Linear reasoning. A new form of the Herbrand-Gentzen theorem
inferredcites →https://doi.org/10.2307/2963594openalex-snapshot
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
inferredcites →https://doi.org/10.2307/2964569openalex-snapshot
A counterexample to a conjecture of Scott and Suppes
inferredcites →https://doi.org/10.3233/fi-1982-53-403openalex-snapshot
Complexity of Craig’s Interpolation
inferredcites →https://doi.org/10.4064/fm-47-1-57-103openalex-snapshot
The first order properties of products of algebraic systems
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470996751.ch23openalex-snapshot
Logic in Finite Structures: Definability, Complexity, and Randomness
inferred← citeshttps://doi.org/10.1002/malq.19960420145openalex-snapshot
Some Remarks on Finite Löwenheim‐Skolem Theorems
inferred← citeshttps://doi.org/10.1002/malq.19980440108openalex-snapshot
Capturing Relativized Complexity Classes without Order
inferred← citeshttps://doi.org/10.1002/malq.19990450304openalex-snapshot
On Preservation Theorems for Two‐Variable Logic
inferred← citeshttps://doi.org/10.1006/inco.1997.2675openalex-snapshot
Metafinite Model Theory
inferred← citeshttps://doi.org/10.1006/inco.1998.2701openalex-snapshot
Reflective Relational Machines
inferred← citeshttps://doi.org/10.1006/inco.1998.2731openalex-snapshot
Verifiable Properties of Database Transactions
inferred← citeshttps://doi.org/10.1006/inco.1999.2842openalex-snapshot
Counting Modulo Quantifiers on Finite Structures
inferred← citeshttps://doi.org/10.1006/jcss.2001.1810openalex-snapshot
Aggregate Operators in Constraint Query Languages
inferred← citeshttps://doi.org/10.1007/1-4020-8058-1_17openalex-snapshot
Coordination Infrastructures in the Engineering of Multiagent Systems
inferred← citeshttps://doi.org/10.1007/1-4020-8058-1_4openalex-snapshot
A Survey on Agent-Oriented Oriented Software Engineering Research
inferred← citeshttps://doi.org/10.1007/11523468_116openalex-snapshot
Preservation Under Extensions on Well-Behaved Finite Structures
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_164openalex-snapshot
First-order spectra with one variable
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_1openalex-snapshot
Generalized Quantifiers, an Introduction
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_3openalex-snapshot
A Perspective on Lindström Quantifiers and Oracles
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_39openalex-snapshot
Kolmogorov complexity, restricted nondeterminism and generalized spectra
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_38openalex-snapshot
On logical descriptions of some concepts in structural complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_67openalex-snapshot
Finite-model theory—a personal perspective
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_49openalex-snapshot
Comparing the expressibility of two languages formed using NP-complete graph operators
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_96openalex-snapshot
Infinitary logic for computer science
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_106openalex-snapshot
Computing on structures
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_4openalex-snapshot
Languages for polynomial-time queries — An ongoing quest
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_110openalex-snapshot
Implicit definability and infinitary logic in finite model theory
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_92openalex-snapshot
Metafinite model theory
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_99openalex-snapshot
Preservation theorems in finite model theory
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_37openalex-snapshot
First order logic, fixed point logic and linear order
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_42openalex-snapshot
Generalized implicit definitions on finite structures
inferred← citeshttps://doi.org/10.1007/3-540-63246-8_2openalex-snapshot
Syntax vs. semantics on finite structures
inferred← citeshttps://doi.org/10.1007/3-540-64823-2_15openalex-snapshot
On the power of aggregation in relational query languages
inferred← citeshttps://doi.org/10.1007/3-540-64823-2_5openalex-snapshot
Degrees of monotonicity of spatial transformations
inferred← citeshttps://doi.org/10.1007/3-540-68804-8openalex-snapshot
Finite Model Theory and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_5openalex-snapshot
Embedded Finite Models and Constraint Databases
inferred← citeshttps://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot
Automated Model Building
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_10openalex-snapshot
0–1 Laws for Fragments of Second-Order Logic: An Overview
inferred← citeshttps://doi.org/10.1007/978-1-4612-3466-1_12openalex-snapshot
On Finite Model Theory (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_14openalex-snapshot
Effective Query Answering with Ontologies and DBoxes
inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_13openalex-snapshot
ASNP: A Tame Fragment of Existential Second-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-06773-0_30openalex-snapshot
On-the-Fly Model Checking with Neural MCTS
inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6_20openalex-snapshot
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries
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-85221-6_13openalex-snapshot
Structural Properties of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_27openalex-snapshot
On p-Optimal Proof Systems and Logics for PTIME
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_1openalex-snapshot
Yuri, Logic, and Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_14openalex-snapshot
A Logic for PTIME and a Parameterized Halting Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_2openalex-snapshot
Database Theory, Yuri, and Me
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_28openalex-snapshot
Choiceless Computation and Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_22openalex-snapshot
Preservation under Substructures modulo Bounded Cores
inferred← citeshttps://doi.org/10.1007/978-3-642-32925-8_2openalex-snapshot
Datalog: A Perspective and the Potential
inferred← citeshttps://doi.org/10.1007/978-3-642-33353-8_16openalex-snapshot
Exact Query Reformulation with First-Order Ontologies and Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-60322-8_14openalex-snapshot
The Complexity of Craig Interpolants
inferred← citeshttps://doi.org/10.1007/978-3-642-60322-8_8openalex-snapshot
Spectral Problems and Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-04031-7_10openalex-snapshot
Topological Queries
inferred← citeshttps://doi.org/10.1007/978-3-662-04031-7_3openalex-snapshot
Expressive Power: The Finite Case
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_3openalex-snapshot
Ehrenfeucht-Fraïssé Games
inferred← citeshttps://doi.org/10.1007/978-3-662-21676-7openalex-snapshot
Bounded Variable Logics and Counting
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_4openalex-snapshot
Types and Indiscernibles in Finite Models
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_13openalex-snapshot
Descriptive Complexity of Deterministic Polylogarithmic Time
inferred← citeshttps://doi.org/10.1007/978-3-663-12018-6openalex-snapshot
Dependencies in Relational Databases
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_10openalex-snapshot
Laws in Logic and Combinatorics
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_1openalex-snapshot
Elementary Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_3openalex-snapshot
Complexity of Logical Decision Problems: An Introduction
inferred← citeshttps://doi.org/10.1007/978-94-015-8533-0_6openalex-snapshot
Implicit and Explicit Definability in Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-94-015-9833-0_1openalex-snapshot
Elementary Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_5openalex-snapshot
On Bounded Set Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_6openalex-snapshot
Infinitary Logic in Finite Model Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_1openalex-snapshot
Quantifiers, Some Problems and Ideas
inferred← citeshttps://doi.org/10.1007/bf00289111openalex-snapshot
On the expressive power of data dependencies
inferred← citeshttps://doi.org/10.1007/bf01195200openalex-snapshot
On completeness for NP via projection translations
inferred← citeshttps://doi.org/10.1007/bf01200263openalex-snapshot
Logical and schematic characterization of complexity classes
inferred← citeshttps://doi.org/10.1007/bf02088013openalex-snapshot
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
inferred← citeshttps://doi.org/10.1007/bf02367195openalex-snapshot
Predicate superintuitionistic logics without interpolation
inferred← citeshttps://doi.org/10.1007/bf02671609openalex-snapshot
Interpolation in superintuitionistic predicate logics with equality
inferred← citeshttps://doi.org/10.1007/bf02674609openalex-snapshot
On a fragment of intuitionistic logic which is complete with respect to the kripke frames with finite domains
inferred← citeshttps://doi.org/10.1007/bf02684086openalex-snapshot
Intermediate predicate logic without the beth property
inferred← citeshttps://doi.org/10.1007/bfb0022256openalex-snapshot
Monadic logical definability of NP-complete problems
inferred← citeshttps://doi.org/10.1007/bfb0022280openalex-snapshot
A bounded set theory with Anti-Foundation Axiom and inductive definability
inferred← citeshttps://doi.org/10.1007/bfb0026294openalex-snapshot
Completeness with respect to interpretations in deterministic and nondeterministic polynomial time
inferred← citeshttps://doi.org/10.1007/bfb0039616openalex-snapshot
Expressibility of first order logic with a nondeterministic inductive operator
inferred← citeshttps://doi.org/10.1007/bfb0049330openalex-snapshot
Bounded-arity hierarchies in fixed-point logics
inferred← citeshttps://doi.org/10.1007/bfb0057715openalex-snapshot
Untyped queries, untyped reflective machines and conditional quantifiers
inferred← citeshttps://doi.org/10.1007/pl00001594openalex-snapshot
Monadic logical definability of nondeterministic linear time
inferred← citeshttps://doi.org/10.1007/s00012-009-0022-2openalex-snapshot
Epimorphisms in cylindric algebras and definability in finite variable logic
inferred← citeshttps://doi.org/10.1007/s00153-011-0262-7openalex-snapshot
On vectorizations of unary generalized quantifiers
inferred← citeshttps://doi.org/10.1007/s001530050127openalex-snapshot
Bounded variable logics: two, three, and more
inferred← citeshttps://doi.org/10.1007/s10114-005-0537-1openalex-snapshot
The Theory of Finite Models without Equal Sign
inferred← citeshttps://doi.org/10.1007/s11225-017-9710-7openalex-snapshot
Relativised Homomorphism Preservation at the Finite Level
inferred← citeshttps://doi.org/10.1007/s12133-007-0012-9openalex-snapshot
Varieties of Finitism
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90009-aopenalex-snapshot
First-order spectra with one variable
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90043-iopenalex-snapshot
Using the Hamiltonian path operator to capture NP
inferred← citeshttps://doi.org/10.1016/0165-0114(92)90186-8openalex-snapshot
Formal frameworks for approximate reasoning
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90033-0openalex-snapshot
Program derivation by fixed point computation
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90040-0openalex-snapshot
Henkin quantifiers and complete problems
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00025-xopenalex-snapshot
Generalized quantifiers and pebble games on finite structures
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90363-kopenalex-snapshot
Characterizing complexity classes by higher type primitive recursive definitions
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90386-topenalex-snapshot
Bounded linear logic: a modular approach to polynomial-time computability
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90218-iopenalex-snapshot
Finite-model theory - a personal perspective
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90345-topenalex-snapshot
Hereditarily-finite sets, data bases and polynomial-time computability
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90032-6openalex-snapshot
The computational complexity of asymptotic problems I: Partial orders
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90006-4openalex-snapshot
Inductive definitions over finite structures
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90065-popenalex-snapshot
0–1 Laws and decision problems for fragments of second-order logic
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90059-bopenalex-snapshot
The expressive power of stratified logic programs
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90021-7openalex-snapshot
Infinitary logics and 0–1 laws
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90062-kopenalex-snapshot
Characterizing complexity classes by general recursive definitions in higher types
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.06.001openalex-snapshot
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.10.005openalex-snapshot
Homomorphism preservation on quasi-wide classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.003openalex-snapshot
Descriptive complexity of deterministic polylogarithmic time and space
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.009openalex-snapshot
Computing queries with higher-order logics
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80062-5openalex-snapshot
A logic for constant-depth circuits
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80027-9openalex-snapshot
A zero-one law for logic with a fixed-point operator
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80071-6openalex-snapshot
Datalog vs first-order logic
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00008-0openalex-snapshot
How to define a linear order on finite models
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80066-4openalex-snapshot
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80028-5openalex-snapshot
Algebra, categories and databases
inferred← citeshttps://doi.org/10.1017/9781108242066openalex-snapshot
Proof Complexity
inferred← citeshttps://doi.org/10.1017/9781108242066.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781108242066.002openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/9781108242066.003openalex-snapshot
Concepts and Problems
inferred← citeshttps://doi.org/10.1017/9781108242066.004openalex-snapshot
Frege Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.005openalex-snapshot
Sequent Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.007openalex-snapshot
Resolution
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.009openalex-snapshot
Further Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.015openalex-snapshot
R and R-Like Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.021openalex-snapshot
Hard Tautologies
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.023openalex-snapshot
Optimality
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1017/9781108242066.025openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108242066.026openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/9781316716830.007openalex-snapshot
Types and Indescernibles in Finite Models
inferred← citeshttps://doi.org/10.1017/jsl.2023.99openalex-snapshot
FORBIDDEN INDUCED SUBGRAPHS AND THE ŁOŚ–TARSKI THEOREM
inferred← citeshttps://doi.org/10.1017/s0956796800003889openalex-snapshot
The expressive power of higher-order types or, life without CONS
inferred← citeshttps://doi.org/10.1017/s0960129500070079openalex-snapshot
Linear time computable problems and first-order descriptions
inferred← citeshttps://doi.org/10.1023/a:1008275906015openalex-snapshot
Modal Logic over Finite Structures
inferred← citeshttps://doi.org/10.1023/a:1018955722107openalex-snapshot
On non-determinism in machines and languages
inferred← citeshttps://doi.org/10.1023/a:1026542526897openalex-snapshot
The Concept of Truth in a Finite Universe
inferred← citeshttps://doi.org/10.1080/01445340.2018.1439257openalex-snapshot
The Context of Inference
inferred← citeshttps://doi.org/10.1090/dimacs/031/01openalex-snapshot
Easier ways to win logical games
inferred← citeshttps://doi.org/10.1093/logcom/exad055openalex-snapshot
The umbilical cord of finite model theory
inferred← citeshttps://doi.org/10.1093/logcom/exaf045openalex-snapshot
The flattening operator in team-based logics
inferred← citeshttps://doi.org/10.1093/logcom/exq009openalex-snapshot
Higher Types, Finite Domains and Resource-bounded Turing Machines
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.001.0001openalex-snapshot
Philosophy and Model Theory
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.002.0003openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0001openalex-snapshot
Logics and languages
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0002openalex-snapshot
Permutations and referential indeterminacy
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0003openalex-snapshot
Ramsey sentences and Newman’s objection
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0004openalex-snapshot
Compactness, infinitesimals, and the reals
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0005openalex-snapshot
Sameness of structure and theory
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0006openalex-snapshot
Modelism and mathematical doxology
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0007openalex-snapshot
Categoricity and the natural numbers
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0008openalex-snapshot
Categoricity and the sets
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0009openalex-snapshot
Transcendental arguments against model-theoretical scepticism
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0010openalex-snapshot
Internal categoricity and the natural numbers
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0011openalex-snapshot
Internal categoricity and the sets
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0012openalex-snapshot
Internal categoricity and truth
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0013openalex-snapshot
Boolean-valued structures
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0014openalex-snapshot
Types and Stone spaces
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0015openalex-snapshot
Indiscernibility
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0016openalex-snapshot
Quantifiers
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0017openalex-snapshot
Classification and uncountable categoricity
inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0018openalex-snapshot
Wilfrid Hodges A short history of model theory
inferred← citeshttps://doi.org/10.1109/69.634755openalex-snapshot
Transactions and updates in deductive databases
inferred← citeshttps://doi.org/10.1109/lics.1989.39191openalex-snapshot
Characterizing complexity classes by higher type primitive recursive definitions
inferred← citeshttps://doi.org/10.1109/lics.1990.113742openalex-snapshot
0-1 laws for infinitary logics
inferred← citeshttps://doi.org/10.1109/lics.1990.113743openalex-snapshot
Implicit definability on finite structures and unambiguous computations
inferred← citeshttps://doi.org/10.1109/lics.1992.185518openalex-snapshot
Fixpoint logic vs. infinitary logic in finite-model theory
inferred← citeshttps://doi.org/10.1109/lics.1992.185520openalex-snapshot
Axiomatizable classes of finite models and definability of linear order
inferred← citeshttps://doi.org/10.1109/lics.1992.185547openalex-snapshot
Generalized quantifiers and pebble games on finite structures
inferred← citeshttps://doi.org/10.1109/lics.1994.316067openalex-snapshot
The power of reflective relational machines
inferred← citeshttps://doi.org/10.1109/lics.1994.316088openalex-snapshot
How to define a linear order on finite models
inferred← citeshttps://doi.org/10.1109/lics.1994.316089openalex-snapshot
Generalized quantifiers for simple properties
inferred← citeshttps://doi.org/10.1109/lics.1996.561361openalex-snapshot
More about recursive structures: descriptive complexity and zero-one laws
inferred← citeshttps://doi.org/10.1109/lics.1998.705639openalex-snapshot
Fixed-point logics on planar graphs
inferred← citeshttps://doi.org/10.1109/lics.2001.932489openalex-snapshot
Logician in the land of OS: abstract state machines in Microsoft
inferred← citeshttps://doi.org/10.1109/lics.2007.39openalex-snapshot
Reflections on Finite Model Theory
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470742openalex-snapshot
Forbidden Induced Subgraphs and the Łoś–Tarski Theorem
inferred← citeshttps://doi.org/10.1109/sct.1992.215391openalex-snapshot
Fixpoint logics, relational machines, and computational complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1985.27openalex-snapshot
Fixed-point extensions of first-order logic
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63469openalex-snapshot
Datalog vs. first-order logic
inferred← citeshttps://doi.org/10.1109/time.2005.35openalex-snapshot
Temporal Query Languages Expressive Power: µTL versus T-WHILE
inferred← citeshttps://doi.org/10.1109/time.2007.60openalex-snapshot
SQTL: A Preliminary Proposal for a Temporal-to-Temporal Query Language
inferred← citeshttps://doi.org/10.1137/0213042openalex-snapshot
Equivalence Relations, Invariants, and Normal Forms
inferred← citeshttps://doi.org/10.1137/0219026openalex-snapshot
Expressibility and Nonuniform Complexity Classes
inferred← citeshttps://doi.org/10.1137/060658709openalex-snapshot
Preservation under Extensions on Well-Behaved Finite Structures
showing the first 200 of 242 · page through all 242
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.