On the public citation graph
A generalization of Ehrenfeucht’s game and some applications
0 signed · 39 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/bf02019776openalex-snapshot
Generalized quantifiers and well orderings
inferredcites →https://doi.org/10.1007/bfb0079102openalex-snapshot
The monadic fragment of predicate calculus with the Chang quantifier and equality
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50019-8openalex-snapshot
LANGUAGES WITH ADDED QUANTIFIER “THERE EXIST AT LEAST χα”
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
inferredcites →https://doi.org/10.4064/fm-54-3-291-302openalex-snapshot
Skolem-type normal forms for first-order languages with a generalized quantifier
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.19750210131openalex-snapshot
Entscheidbarkeit von Theorien in Logiken mit verallgemeinerten Quantoren
inferred← citeshttps://doi.org/10.1002/malq.19760220130openalex-snapshot
Entscheidbarkeit in Speziellen Uniformen Strukturen Bezüglich Sprachen Mit Mächtigkeitsquantoren
inferred← citeshttps://doi.org/10.1002/malq.19770231802openalex-snapshot
Entscheidbarkeit Der Theorie Der Linearen Ordnung In L
inferred← citeshttps://doi.org/10.1002/malq.19770232711openalex-snapshot
The Theory of Abelian Groups With the Quantifier (≦ x)
inferred← citeshttps://doi.org/10.1002/malq.19780240110openalex-snapshot
Entscheidbarkeit der Theorie der Linearen Ordnung in L für Reguläres ωx
inferred← citeshttps://doi.org/10.1002/malq.19780241913openalex-snapshot
Zum Entscheidungsproblem für Theorien in Logiken mit Monadischen Verallgemeinerten Quantoren
inferred← citeshttps://doi.org/10.1002/malq.19790251906openalex-snapshot
Entscheidbarkeit der Theorie der Linearen Ordnung in Logiken mit Mächtigkeitsquantoren bzw. mit Chang‐Quantor
inferred← citeshttps://doi.org/10.1002/malq.19810270207openalex-snapshot
UNTERSUCHUNGEN ZUR THEORIE DER LINEAREN ORDNUNG IN LOGIKEN MIT MÄCHTIGKEITSQUANTOREN
inferred← citeshttps://doi.org/10.1002/malq.19850310902openalex-snapshot
The Boolean Sentence Algebra of the Theory of Linear Ordering is Atomic with Respect to Logics with a Malitz Quantifier
inferred← citeshttps://doi.org/10.1002/malq.19880340606openalex-snapshot
Notion of Interpretation and Nonelementary Languages
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_122openalex-snapshot
Decidability of ω — Trees with Bounded Sets — A Survey
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_38openalex-snapshot
Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_12openalex-snapshot
An Automaton over Data Words That Captures EMSO Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
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/978-94-017-0522-6_6openalex-snapshot
Theory of Linear Order in Extended Logics
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/bfb0067660openalex-snapshot
On the decidability of the theory of linear orderings in the language L(Q1)
inferred← citeshttps://doi.org/10.1007/bfb0096899openalex-snapshot
Ehrenfeucht games for generalized quantifiers
inferred← citeshttps://doi.org/10.1007/bfb0096905openalex-snapshot
Decision problems for generalized quantifiers — A survey
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90012-1openalex-snapshot
The expressive power of Malitz quantifiers for linear orderings
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.010openalex-snapshot
Muller message-passing automata and logics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)72006-8openalex-snapshot
Decidability and Generalized Quantifiers
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70481-1openalex-snapshot
Back-and-Forth Systems for Arbitrary Quantifiers
inferred← citeshttps://doi.org/10.1070/rm1978v033n02abeh002304openalex-snapshot
DECIDABILITY PROBLEMS OF EXTENDED THEORIES
inferred← citeshttps://doi.org/10.1090/s0002-9947-1981-0590414-4openalex-snapshot
Stationary Logic and Ordinals
inferred← citeshttps://doi.org/10.1216/rmj-1987-17-2-227openalex-snapshot
Topological games: On the 50th anniversary of the Banach Mazur game
inferred← citeshttps://doi.org/10.1305/ndjfl/1093883342openalex-snapshot
On extensions of $L_{\omega \omega }(Q_1)$.
inferred← citeshttps://doi.org/10.2140/pjm.1977.72.293openalex-snapshot
An Ehrenfeucht game for the multivariable quantifiers of Malitz and some applications
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.