On the public citation graph
First-order logic and its extensions
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02008533openalex-snapshot
Hanf numbers and well-ordering numbers
inferredcites →https://doi.org/10.1007/bf02771648openalex-snapshot
Hanf numbers for fragments of ℶ h (A)
inferredcites →https://doi.org/10.1007/bf02945116openalex-snapshot
A note on the elementary theory of finite abelian groups
inferredcites →https://doi.org/10.1007/bfb0059538openalex-snapshot
Infinitary properties, local functors, and systems of ordinal functions
inferredcites →https://doi.org/10.1007/bfb0066791openalex-snapshot
Descriptive set theory in $$L_{\omega _l \omega }$$
inferredcites →https://doi.org/10.1007/bfb0066794openalex-snapshot
Vaught sentences and Lindström's regular relations
inferredcites →https://doi.org/10.1007/bfb0079681openalex-snapshot
Some remarks on the model theory of infinitary languages
inferredcites →https://doi.org/10.1016/0003-4843(74)90016-3openalex-snapshot
Axioms for abstract model theory
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50043-5openalex-snapshot
FINITE-QUANTIFIER EQUIVALENCE
inferredcites →https://doi.org/10.1016/s0049-237x(08)71684-7openalex-snapshot
Distributive Normal Forms in First-Order Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.1090/s0002-9904-1956-10036-0openalex-snapshot
A partition calculus in set theory
inferredcites →https://doi.org/10.1111/j.1755-2567.1966.tb00599.xopenalex-snapshot
On Relations between Structures
inferredcites →https://doi.org/10.1111/j.1755-2567.1966.tb00600.xopenalex-snapshot
First Order Predicate Logic with Generalized Quantifiers
inferredcites →https://doi.org/10.1111/j.1755-2567.1969.tb00356.xopenalex-snapshot
On Extensions of Elementary Logic
inferredcites →https://doi.org/10.2307/2272748openalex-snapshot
The Hanf number of second order logic
inferredcites →https://doi.org/10.2307/2964289openalex-snapshot
Finite Axiomatizability using additional predicates
inferredcites →https://doi.org/10.4064/fm-53-3-309-324openalex-snapshot
Incompactness in languages with infinitely long expressions
inferredcites →https://doi.org/10.4064/fm-54-3-291-302openalex-snapshot
Skolem-type normal forms for first-order languages with a generalized quantifier
inferredcites →https://doi.org/10.4064/fm-73-3-219-233openalex-snapshot
Svenonius sentences and Lindström's theory on preservation theorems
inferredcites →https://doi.org/10.4064/fm-82-2-153-165openalex-snapshot
Two notes on abstract model theory. I. Properties invariant on the range of definable relations between structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19810271103openalex-snapshot
Applications of Many‐Sorted Robinson Consistency Theorem
inferred← citeshttps://doi.org/10.1002/malq.19850313107openalex-snapshot
Duality for Compact Logics and Substitution in Abstract Model Theory
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_35openalex-snapshot
A Logical Viewpoint on Process-Algebraic Quotients
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_89openalex-snapshot
On the Ehrenfeucht-Fraïssé game in theoretical computer science
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_1openalex-snapshot
Elementary Predicate Logic
inferred← citeshttps://doi.org/10.1007/bf00372550openalex-snapshot
Elementary extensions of topological models in L t language
inferred← citeshttps://doi.org/10.1007/bf01351676openalex-snapshot
The theory of successor with an extra predicate
inferred← citeshttps://doi.org/10.1007/bf02007264openalex-snapshot
Some model theory for monotone quantifiers
inferred← citeshttps://doi.org/10.1007/bf02011637openalex-snapshot
A unifying approach to theorems on preservation and interpolation for binary relations between structures
inferred← citeshttps://doi.org/10.1007/bf02011864openalex-snapshot
On the elementary theory of inductive order
inferred← citeshttps://doi.org/10.1007/bf02318027openalex-snapshot
Interpolation, compactness and JEP in soft model theory
inferred← citeshttps://doi.org/10.1007/bf02483107openalex-snapshot
Elementary properties of free extensions
inferred← citeshttps://doi.org/10.1007/bf02584060openalex-snapshot
A group-theoretical invariant for elementary equivalence and its role in representations of elementary classes
inferred← citeshttps://doi.org/10.1007/bf02584746openalex-snapshot
On the preservation of elementary equivalence and embedding by bounded filtered powers and structures of stable continuous functions
inferred← citeshttps://doi.org/10.1007/s11225-016-9664-1openalex-snapshot
Bi-Simulating in Bi-Intuitionistic Logic
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90021-3openalex-snapshot
Compactness, interpolation and Friedman's third problem
inferred← citeshttps://doi.org/10.1016/0021-8693(82)90238-1openalex-snapshot
Existentially closed linear groups
inferred← citeshttps://doi.org/10.1016/0168-0072(83)90021-0openalex-snapshot
Positive results in abstract model theory: a theory of compact logics
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90025-9openalex-snapshot
The model-theoretic structure of abelian group rings
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50018-xopenalex-snapshot
Löwenheim-Skolem Theorems
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102916openalex-snapshot
Lindström theorems in graded model theory
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103346openalex-snapshot
A Lindström theorem for intuitionistic first-order logic
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91242-6openalex-snapshot
The complexity of the validity problem for dynamic logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71821-4openalex-snapshot
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)72009-3openalex-snapshot
Compactness Properties of Infinitary and Abstract Languages
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70481-1openalex-snapshot
Back-and-Forth Systems for Arbitrary Quantifiers
inferred← citeshttps://doi.org/10.1090/s0002-9947-1979-0546916-0openalex-snapshot
The theorems of Beth and Craig in abstract model theory. I. The abstract setting
inferred← citeshttps://doi.org/10.1090/s0002-9947-1981-0590421-1openalex-snapshot
Robinson's Consistency Theorem in Soft Model Theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1982-0642332-1openalex-snapshot
Duality Between Logics and Equivalence Relations
inferred← citeshttps://doi.org/10.1093/jigpal/jzv054openalex-snapshot
A Lindström-style theorem for finitary propositional weak entailment languages with absurdity
inferred← citeshttps://doi.org/10.1093/logcom/exz011openalex-snapshot
Towards automated reasoning in Herbrand structures
inferred← citeshttps://doi.org/10.1109/lics.2012.32openalex-snapshot
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.1215/00294527-2019-0030openalex-snapshot
A Lindström Theorem for Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635671openalex-snapshot
Stability for pairs of equivalence relations.
inferred← citeshttps://doi.org/10.2168/lmcs-9(1:15)2013openalex-snapshot
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.2307/2273754openalex-snapshot
An algebraic result about soft model theoretical equivalence relations with an application to H. Friedman's fourth problem
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.