On the public citation graph
Beth’s theorem in cardinality logics
0 signed · 33 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.1016/s0003-4843(70)80005-5openalex-snapshot
Logic with the quantifier “there exist uncountably many”
inferredcites →https://doi.org/10.2307/2269698openalex-snapshot
An axiomatic system for the first order language with an equi-cardinality quantifier
inferredcites →https://doi.org/10.2307/2270256openalex-snapshot
Infinitary analogs of theorems from first order model theory
inferredcites →https://doi.org/10.2307/2272338openalex-snapshot
Beth definability in infinitary languages
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.19880340606openalex-snapshot
Notion of Interpretation and Nonelementary Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_7openalex-snapshot
Craig Interpolation for Decidable First-Order Fragments
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_4openalex-snapshot
Finite Generation Problem and n-ary Quantifiers
inferred← citeshttps://doi.org/10.1007/bf01792985openalex-snapshot
Definability properties and the congruence closure
inferred← citeshttps://doi.org/10.1007/bf02011631openalex-snapshot
The theorems of beth and Craig in abstract model theory II. Compact logics
inferred← citeshttps://doi.org/10.1007/bfb0075304openalex-snapshot
Failure of interpolation for quantifiers of monadic type
inferred← citeshttps://doi.org/10.1007/s11229-008-9354-2openalex-snapshot
Harmonious logic: Craig’s interpolation theorem and its descendants
inferred← citeshttps://doi.org/10.1007/s11229-008-9357-zopenalex-snapshot
The Craig Interpolation Theorem in abstract model theory
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90021-8openalex-snapshot
δ-Logics and generalized quantifiers
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90002-8openalex-snapshot
Remarks in abstract model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70457-4openalex-snapshot
The work of Andrzej Mostowski in model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70481-1openalex-snapshot
Back-and-Forth Systems for Arbitrary Quantifiers
inferred← citeshttps://doi.org/10.1017/jsl.2021.7openalex-snapshot
TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
inferred← citeshttps://doi.org/10.1023/a:1005295109904openalex-snapshot
Algebraic Characterizations of Various Beth Definability Properties
inferred← citeshttps://doi.org/10.1090/s0002-9939-1976-0421982-4openalex-snapshot
On the Failure of the Weak Beth Property
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0376334-6openalex-snapshot
Generalized Quantifiers and Compact Logic
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.1305/ndjfl/1093636521openalex-snapshot
Stationary logic and its friends. II.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870821openalex-snapshot
Stationary logic and its friends. I.
inferred← citeshttps://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
inferred← citeshttps://doi.org/10.2307/2272829openalex-snapshot
Ideal models and some not so ideal problems in the model theory of L(Q)
inferred← citeshttps://doi.org/10.2307/2275278openalex-snapshot
The Beth-closure of ℒ(Qα) is not finitely generated
inferred← citeshttps://doi.org/10.3233/978-1-58603-782-6-261openalex-snapshot
Encounters with A. Mostowski
inferred← citeshttps://doi.org/10.48550/arxiv.1401.6682openalex-snapshot
On logics extended with embedding-closed quantifiers
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.