On the public citation graph
Methods in Mathematical Logic
0 signed · 47 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/aima.1998.1752openalex-snapshot
Perfect-Set Properties inL(R)[U]
inferred← citeshttps://doi.org/10.1006/inco.1997.2674openalex-snapshot
Some Consequences of Cryptographical Conjectures forS12and EF
inferred← citeshttps://doi.org/10.1007/11494645_32openalex-snapshot
The Small Grzegorczyk Classes and the Typed λ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_1openalex-snapshot
From Universal Logic to Computer Science, and Back
inferred← citeshttps://doi.org/10.1007/bf01793785openalex-snapshot
Elementary embeddings and games in adapted probability logic
inferred← citeshttps://doi.org/10.1007/bf03322623openalex-snapshot
Computing Final Polynomials and Final Syzygies Using Buchberger’s Gröbner Bases Method
inferred← citeshttps://doi.org/10.1007/bfb0097335openalex-snapshot
Concerning stationary subsets of [λ]<κ
inferred← citeshttps://doi.org/10.1007/s00224-007-9021-xopenalex-snapshot
Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T
inferred← citeshttps://doi.org/10.1007/s11787-013-0093-xopenalex-snapshot
The Institution-Theoretic Scope of Logic Theorems
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90019-xopenalex-snapshot
Strong conceptual completeness for first-order logic
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00029-gopenalex-snapshot
Transfinite induction within Peano arithmetic
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90072-2openalex-snapshot
Resolution proofs of generalized pigeonhole principles
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90317-uopenalex-snapshot
On the complexity of counting in the polynomial hierarchy
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50023-3openalex-snapshot
Paraconsistent Logics and Paraconsistency
inferred← citeshttps://doi.org/10.1016/j.aim.2018.03.035openalex-snapshot
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
inferred← citeshttps://doi.org/10.1016/j.aim.2023.108938openalex-snapshot
Anti-classification results for groups acting freely on the line
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.009openalex-snapshot
Towards NP – P via proof complexity and search
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.apal.2019.102717openalex-snapshot
Schmerl decompositions in first order arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103496openalex-snapshot
First-order reasoning and efficient semi-algebraic proofs
inferred← citeshttps://doi.org/10.1016/j.fss.2022.08.024openalex-snapshot
Preservation in many-valued truth institutions
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.009openalex-snapshot
A note on SAT algorithms and proof complexity
inferred← citeshttps://doi.org/10.1016/j.jpaa.2021.106861openalex-snapshot
Real spectra and ℓ-spectra of algebras and vector lattices over countable fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.068openalex-snapshot
Ultraproducts and possible worlds semantics in institutions
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.017openalex-snapshot
Circuit principles and weak pigeonhole variants
inferred← citeshttps://doi.org/10.1016/j.topol.2016.08.018openalex-snapshot
Ramsey ultrafilters and Countable-to-one Uniformization
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80017-7openalex-snapshot
First-Order Proof Theory of Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80033-0openalex-snapshot
Computation Models and Function Algebras
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00029-8openalex-snapshot
Count(ifq) does not imply Count(ifp)
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00060-8openalex-snapshot
Saturation and stability in the theory of computation over the reals
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00051-5openalex-snapshot
Nondeterministic stack register machines
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80119-8openalex-snapshot
Invariant computations for analytic projective geometry
inferred← citeshttps://doi.org/10.1017/9781316716991.002openalex-snapshot
Introduction to the Model Theory of Fields
inferred← citeshttps://doi.org/10.1017/jsl.2017.29openalex-snapshot
CANONICAL MODELS FOR FRAGMENTS OF THE AXIOM OF CHOICE
inferred← citeshttps://doi.org/10.1017/s0022481200029078openalex-snapshot
Finite automata, real time processes and counting problems in bounded arithmetics
inferred← citeshttps://doi.org/10.1145/3406325.3451117openalex-snapshot
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly
inferred← citeshttps://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferred← citeshttps://doi.org/10.2178/jsl/1080938841openalex-snapshot
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
inferred← citeshttps://doi.org/10.2307/2586729openalex-snapshot
Witnessing functions in bounded arithmetic and search problems
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.