On the public citation graph
On the semantics of the Henkin quantifier
0 signed · 40 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.1002/malq.19690152301openalex-snapshot
SEMANTISCHE UNTERSUCHUNGEN ÜBER QUANTOREN I
inferredcites →https://doi.org/10.1002/malq.19700160802openalex-snapshot
Finite Partially‐Ordered Quantifiers
inferredcites →https://doi.org/10.1007/978-3-030-52279-7_15openalex-snapshot
Models and Ultraproducts
inferredcites →https://doi.org/10.1016/0003-4843(74)90016-3openalex-snapshot
Axioms for abstract model theory
inferredcites →https://doi.org/10.1016/0041-5553(70)90206-5openalex-snapshot
Colloquium on the foundations of mathematics, mathematical machines and their applications
inferredcites →https://doi.org/10.1111/j.1755-2567.1969.tb00356.xopenalex-snapshot
On Extensions of Elementary Logic
inferredcites →https://doi.org/10.2307/2269726openalex-snapshot
K. Jaakko Hintikka. Reductions in the theory of types. Two papers on symbolic logic, Acta philosophica Fennica no. 8, Helsinki1955, pp. 57–115.
inferredcites →https://doi.org/10.4064/fm-66-1-147-152openalex-snapshot
Incompleteness of Lp 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.19810273107openalex-snapshot
The Henkin Quantifier and Real Closed Fields
inferred← citeshttps://doi.org/10.1002/malq.19870330411openalex-snapshot
On Some Applications of Games for Härtig Quantifier
inferred← citeshttps://doi.org/10.1002/malq.19890350106openalex-snapshot
Pure Logic with Branched Quantifiers
inferred← citeshttps://doi.org/10.1002/malq.19920380134openalex-snapshot
PARTIALLY ORDERED CONNECTIVES
inferred← citeshttps://doi.org/10.1002/malq.200410057openalex-snapshot
Recursive complexity of the Carnap first order modal logic C
inferred← citeshttps://doi.org/10.1007/978-1-4020-6324-4_4openalex-snapshot
Quantifiers in Formal and Natural Languages
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_23openalex-snapshot
The Relational Semantics for Branched Quantifiers
inferred← citeshttps://doi.org/10.1007/978-94-010-9847-2_1openalex-snapshot
Game-Theoretical Semantics: Insights and Prospects
inferred← citeshttps://doi.org/10.1007/978-94-015-8601-6_3openalex-snapshot
Defining Truth, the Whole Truth and Nothing but the Truth
inferred← citeshttps://doi.org/10.1007/978-94-017-0524-0_4openalex-snapshot
Partially Ordered Connectives and Finite Graphs
inferred← citeshttps://doi.org/10.1007/978-94-017-2045-8_10openalex-snapshot
What is the Logic of Parallel Processing?
inferred← citeshttps://doi.org/10.1007/bf00970312openalex-snapshot
Some theorems in generalized calculuses
inferred← citeshttps://doi.org/10.1007/bf01049180openalex-snapshot
On the logic of informational independence and its applications
inferred← citeshttps://doi.org/10.1007/s00153-004-0220-8openalex-snapshot
Degrees of logics with Henkin quantifiers in poor vocabularies
inferred← citeshttps://doi.org/10.1007/s11050-023-09216-xopenalex-snapshot
Quantification, matching and events
inferred← citeshttps://doi.org/10.1007/s44204-025-00245-3openalex-snapshot
Frege’s principle of logical parsimony, the indispensability of “ξ = ζ” in Grundgesetze, and the nature of identity
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90005-4openalex-snapshot
Boolean valued models and generalized quantifiers
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90071-7openalex-snapshot
Henkin and function quantifiers
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90003-iopenalex-snapshot
Decidability problems in languages with Henkin quantifiers
inferred← citeshttps://doi.org/10.1016/b978-0-323-95504-1.40057-8openalex-snapshot
Game-Theoretical Semantics
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50009-6openalex-snapshot
Game-Theoretical Semantics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71637-9openalex-snapshot
Abstract Logic and Set Theory. I. Definability
inferred← citeshttps://doi.org/10.1017/jsl.2023.2openalex-snapshot
MAXIMALITY OF LOGIC WITHOUT IDENTITY
inferred← citeshttps://doi.org/10.1017/s1079898600004819openalex-snapshot
2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
inferred← citeshttps://doi.org/10.1023/a:1017905122049openalex-snapshot
If-Logic and Truth-definition
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.1145/3750044openalex-snapshot
Regular Representations of Uniform TC 0
inferred← citeshttps://doi.org/10.1305/ndjfl/1093883627openalex-snapshot
Game-theoretical semantics: insights and prospects.
inferred← citeshttps://doi.org/10.2307/2687746openalex-snapshot
2001 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '01
inferred← citeshttps://doi.org/10.5117/9789053563564openalex-snapshot
Interactive Logic : Selected Papers from the 7th Augustus de Morgan Workshop, London
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.