On the public citation graph
The Syntax and Semantics of Infinitary Languages
0 signed · 107 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/bfb0079680openalex-snapshot
Implicit definability and compactness in infinitary languages
inferredcites →https://doi.org/10.1007/bfb0079681openalex-snapshot
Some remarks on the model theory of infinitary languages
inferredcites →https://doi.org/10.1007/bfb0079684openalex-snapshot
An algebraic proof of the barwise compactness theorem
inferredcites →https://doi.org/10.1007/bfb0079688openalex-snapshot
Definability, automorphisms, and 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.19720182506openalex-snapshot
Partial Isomorphisms and Infinitary Languages
inferred← citeshttps://doi.org/10.1002/malq.19890350202openalex-snapshot
Notes on Formal Theories of Truth
inferred← citeshttps://doi.org/10.1006/aima.1999.1852openalex-snapshot
The Automorphism Tower Problem Revisited
inferred← citeshttps://doi.org/10.1007/11780274_30openalex-snapshot
A Stochastic Theory of Black-Box Software Testing
inferred← citeshttps://doi.org/10.1007/3-540-45504-3_4openalex-snapshot
Comparing the Complexity of Cut-Elimination Methods
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_4openalex-snapshot
Algorithmic structuring of cut-free proofs
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_29openalex-snapshot
Explaining Gentzen's consistency proof within infinitary proof theory
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_13openalex-snapshot
On Some Semi-constructive Theories Related to Kripke–Platek Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_5openalex-snapshot
A Labelled Sequent-Calculus for Observation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_6openalex-snapshot
A Deductive Approach to Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-7908-1818-5_1openalex-snapshot
A Natural Deduction System for Intuitionistic Fuzzy Logic
inferred← citeshttps://doi.org/10.1007/978-94-007-0320-9_5openalex-snapshot
Reduction and Elimination
inferred← citeshttps://doi.org/10.1007/978-94-009-9825-4_6openalex-snapshot
Game-Theoretical Semantics and Back-and-Forth
inferred← citeshttps://doi.org/10.1007/978-94-009-9825-4_9openalex-snapshot
Hierarchies of Model Theoretic Definability—an Approach to Second Order Logics
inferred← citeshttps://doi.org/10.1007/978-94-009-9860-5_7openalex-snapshot
A Generalization of the Infinitely Deep Languages of Hintikka and Rantala
inferred← citeshttps://doi.org/10.1007/bf00972801openalex-snapshot
Cardinality of models for theories in a calculus with a Härtig quantifier
inferred← citeshttps://doi.org/10.1007/bf01974148openalex-snapshot
Mehrsortige logische Systeme mit unendlich langen Formeln I
inferred← citeshttps://doi.org/10.1007/bf02011638openalex-snapshot
Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
inferred← citeshttps://doi.org/10.1007/bf02771648openalex-snapshot
Hanf numbers for fragments of ℶ h (A)
inferred← citeshttps://doi.org/10.1007/bfb0029955openalex-snapshot
The expressiveness of Datalog cicuits (DAC)
inferred← citeshttps://doi.org/10.1007/bfb0079424openalex-snapshot
Set theory in infinitary languages
inferred← citeshttps://doi.org/10.1007/bfb0079549openalex-snapshot
Kombinatorische Konstruktionen mit Beweisen und Schnittelimination
inferred← citeshttps://doi.org/10.1007/bfb0081120openalex-snapshot
Back-and-forth arguments and infinitary logics
inferred← citeshttps://doi.org/10.1007/bfb0081121openalex-snapshot
Consistency properties for finite quantifier languages
inferred← citeshttps://doi.org/10.1007/bfb0081122openalex-snapshot
Chain models: Applications of consistency properties and back-and-forth techniques in infinite-quantifier languages
inferred← citeshttps://doi.org/10.1007/bfb0081123openalex-snapshot
On a finiteness condition for infinitary languages
inferred← citeshttps://doi.org/10.1007/s00153-023-00902-5openalex-snapshot
Cut elimination for coherent theories in negation normal form
inferred← citeshttps://doi.org/10.1016/0003-4843(70)90006-9openalex-snapshot
Infinitary properties of abelian torsion groups
inferred← citeshttps://doi.org/10.1016/0003-4843(70)90007-0openalex-snapshot
Finite diagrams stable in power
inferred← citeshttps://doi.org/10.1016/0003-4843(72)90010-1openalex-snapshot
On reduced products and filters
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90018-8openalex-snapshot
Almost-disjoint sets the dense set problem and the partition calculus
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90026-7openalex-snapshot
A new approach to infinitary languages
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90008-0openalex-snapshot
An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90010-9openalex-snapshot
Countable approximations and Löwenheim-Skolem theorems
inferred← citeshttps://doi.org/10.1016/0021-8693(73)90062-8openalex-snapshot
Countable type local theorems in algebra
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90078-9openalex-snapshot
An independence result for (II11-CA)+BI
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00045-5openalex-snapshot
Back and forth relations for reduced abelian p-groups
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90011-hopenalex-snapshot
Constructive logics Part I: A tutorial on proof systems and typed λ-calculi
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50003-7openalex-snapshot
Infinite Combinatorics
inferred← citeshttps://doi.org/10.1016/j.apal.2007.08.001openalex-snapshot
Sufficient conditions for cut elimination with complexity analysis
inferred← citeshttps://doi.org/10.1016/j.apal.2008.07.002openalex-snapshot
Abstract elementary classes and infinitary logics
inferred← citeshttps://doi.org/10.1016/j.apal.2010.03.001openalex-snapshot
A minimal classical sequent calculus free of structural rules
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.002openalex-snapshot
Linear orderings and powers of characterizable cardinals
inferred← citeshttps://doi.org/10.1016/j.apal.2016.12.003openalex-snapshot
Unifying the model theory of first-order and second-order arithmetic via WKL0⁎
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.011openalex-snapshot
Deduction chains for common knowledge
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.05.001openalex-snapshot
Dual Systems of Tableaux and Sequents for PLTL
inferred← citeshttps://doi.org/10.1016/j.jpaa.2016.02.002openalex-snapshot
μ-Abstract elementary classes and other generalizations
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.10.005openalex-snapshot
Towards a clausal analysis of cut-elimination
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71124-8openalex-snapshot
Proof Theory: Some Applications of Cut-Elimination
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71365-xopenalex-snapshot
A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80009-8openalex-snapshot
Chapter 8 Groups of computable automorphisms
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80016-5openalex-snapshot
An Introduction to Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80024-4openalex-snapshot
A Proof-Theoretic Framework for Logic Programming
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00080-5openalex-snapshot
Karp complexity and classes with the independence property
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73824-6openalex-snapshot
Models Built on Linear Orderings
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00297-7openalex-snapshot
Computation by ‘While’ programs on topological partial algebras
inferred← citeshttps://doi.org/10.1017/cbo9780511896262.006openalex-snapshot
A simplified version of local predicativity
inferred← citeshttps://doi.org/10.1017/jsl.2016.25openalex-snapshot
DISJOINT AMALGAMATION IN LOCALLY FINITE AEC
inferred← citeshttps://doi.org/10.1017/s000497270004644xopenalex-snapshot
On properties of countable character
inferred← citeshttps://doi.org/10.1017/s0012217300050034openalex-snapshot
Logique mathématique et philosophie des mathématiques
inferred← citeshttps://doi.org/10.1017/s0305004100049380openalex-snapshot
Presentations of skew fields. I. Existentially closed skew fields and the Nullstellensatz
inferred← citeshttps://doi.org/10.1017/s0305004100073291openalex-snapshot
McLain groups over arbitrary rings and orderings
inferred← citeshttps://doi.org/10.1090/proc/14240openalex-snapshot
Two circles and only a straightedge
inferred← citeshttps://doi.org/10.1090/s0002-9939-1972-0294114-xopenalex-snapshot
A Note on Model Complete Models and Generic Models
inferred← citeshttps://doi.org/10.1090/s0002-9947-00-02604-0openalex-snapshot
On the number of ${L}_{\infty \omega _1}$-equivalent non-isomorphic models
inferred← citeshttps://doi.org/10.1090/s0002-9947-1978-0462942-3openalex-snapshot
𝐿_{∞}_{𝜆}-equivalence, isomorphism and potential isomorphism
inferred← citeshttps://doi.org/10.1090/s0273-0979-1985-15413-8openalex-snapshot
Book Review: Fundamentals of generalized recursion theory
inferred← citeshttps://doi.org/10.1093/jigpal/jzm051openalex-snapshot
Games on Trees and Syntactical Complexity of Formulas
inferred← citeshttps://doi.org/10.1093/mind/fzv112openalex-snapshot
What Is the Well-Foundedness of Grounding?
inferred← citeshttps://doi.org/10.1134/s1995080214040192openalex-snapshot
Using computability to measure complexity of algebraic structures and classes of structures
inferred← citeshttps://doi.org/10.1201/b16416-12openalex-snapshot
Filters and Ultraproducts on Projective Sets
inferred← citeshttps://doi.org/10.1201/b21197-3openalex-snapshot
Computing Categories, Language Fragments, and Models
inferred← citeshttps://doi.org/10.1590/0100-6045.2023.v46n4.dfopenalex-snapshot
ON THE COMPARISONS OF LOGICS IN TERMS OF EXPRESSIVE POWER
inferred← citeshttps://doi.org/10.2178/bsl/1080330272openalex-snapshot
Barwise: Infinitary Logic and Admissible Sets
inferred← citeshttps://doi.org/10.2178/bsl/1318855631openalex-snapshot
Early History of the Generalized Continuum Hypothesis: 1878–1938
inferred← citeshttps://doi.org/10.2307/2269953openalex-snapshot
Incompleteness of a formal system for infinitary finite-quantifier formulas
inferred← citeshttps://doi.org/10.2307/2270906openalex-snapshot
Applications of Strict Π11 predicates to infinitary logic
inferred← citeshttps://doi.org/10.2307/2273036openalex-snapshot
Complete types and the natural numbers
inferred← citeshttps://doi.org/10.2307/2274701openalex-snapshot
Extended ultrapowers and the Vopěnka-Hrbáček theorem without choice
inferred← citeshttps://doi.org/10.2307/2275150openalex-snapshot
On the number of automorphisms of uncountable models
inferred← citeshttps://doi.org/10.2307/2275441openalex-snapshot
A proof-theoretic characterization of the primitive recursive set functions
inferred← citeshttps://doi.org/10.2307/2586507openalex-snapshot
Interpolation, preservation, and pebble games
inferred← citeshttps://doi.org/10.2307/2586617openalex-snapshot
An elementary definability theorem for first order logic
inferred← citeshttps://doi.org/10.2307/2586846openalex-snapshot
Explicit mathematics with the monotone fixed point principle
inferred← citeshttps://doi.org/10.2969/jmsj/02510027openalex-snapshot
Model theory on a positive second order logic with countable conjunctions and disjunctions
inferred← citeshttps://doi.org/10.2969/jmsj/02520250openalex-snapshot
An extended relativization theorem
inferred← citeshttps://doi.org/10.4000/msh.2959openalex-snapshot
Proof Theory of Martin-Löf Type Theory. An overview
inferred← citeshttps://doi.org/10.70930/tac/pucl8bxropenalex-snapshot
Atomic Toposes with Co-Well-Founded Categories of Atoms
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.