On the public citation graph

Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem

https://doi.org/10.1007/bf01448447
0 signed · 70 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/mmnd.19870340102openalex-snapshot
Variabilität, Merkmalswandel und Phylogenie der Elcanidae im Jungpaläozoikum und Mesozoikum und die Phylogenie der Ensifera (Orthopteroida, Ensifera)
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_8openalex-snapshot
Decision procedures for some fragments of set theory
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_237openalex-snapshot
Towards practical implementations of syllogistic
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_25openalex-snapshot
Encompassment properties and automata with constraints
inferred← citeshttps://doi.org/10.1007/978-0-85729-808-9_3openalex-snapshot
A Survey of Inference Mechanisms
inferred← citeshttps://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_20openalex-snapshot
How to Win First-Order Safety Games
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_3openalex-snapshot
Symbol Elimination and Applications to Parametric Entailment Problems
inferred← citeshttps://doi.org/10.1007/978-3-0348-9114-1_5openalex-snapshot
La Logique Mathématique en sa jeunesse
inferred← citeshttps://doi.org/10.1007/978-3-319-24312-2_18openalex-snapshot
Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_3openalex-snapshot
Theory-Specific Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-52789-0_5openalex-snapshot
Der erweiterte Prädikatenkalkül.
inferred← citeshttps://doi.org/10.1007/978-3-662-41928-1_4openalex-snapshot
Der engere Prädikatenkalkül
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_3openalex-snapshot
The Confluence of Ideas in 1936
inferred← citeshttps://doi.org/10.1007/978-94-007-5485-0_8openalex-snapshot
Dubislav and Classical Monadic Quantificational Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_3openalex-snapshot
Alternatives to Standard First-Order Semantics
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_6openalex-snapshot
Algorithms and Decision Problems: A Crash Course in Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-9795-0_8openalex-snapshot
The Problem of Complete Decidability of Arithmetical Questions
inferred← citeshttps://doi.org/10.1007/978-94-017-1852-3_19openalex-snapshot
The Decidability of Syllogism
inferred← citeshttps://doi.org/10.1007/bf00243807openalex-snapshot
Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
inferred← citeshttps://doi.org/10.1007/bf01452834openalex-snapshot
Untersuchungen �ber den Funktionenkalk�l f�r endliche Individuenbereiche
inferred← citeshttps://doi.org/10.1007/bf01459101openalex-snapshot
Zum Entscheidungsproblem der mathematischen Logik
inferred← citeshttps://doi.org/10.1007/bf01472201openalex-snapshot
Zum Eliminationsproblem der mathematischen Logik
inferred← citeshttps://doi.org/10.1007/bf01977150openalex-snapshot
Semantische Untersuchungen zur Entscheidbarkeit im Prädikatenkalkül mit Funktionsvariablen
inferred← citeshttps://doi.org/10.1007/bfb0022260openalex-snapshot
Is first order contained in an initial segment of PTIME?
inferred← citeshttps://doi.org/10.1007/s00153-021-00797-0openalex-snapshot
Model theory of monadic predicate logic with the infinity quantifier
inferred← citeshttps://doi.org/10.1007/s10958-009-9400-8openalex-snapshot
Logical equations in monadic logic
inferred← citeshttps://doi.org/10.1007/s11225-018-9815-7openalex-snapshot
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter
inferred← citeshttps://doi.org/10.1007/s11229-008-9352-4openalex-snapshot
Elimination problems in logic: a brief history
inferred← citeshttps://doi.org/10.1016/0196-8858(84)90007-1openalex-snapshot
Decision procedures for elementary sublanguages of set theory. III. Restricted classes of formulas involving the power set operator and the general set union operator
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.023openalex-snapshot
Heterogeneous Reasoning with Euler/Venn Diagrams Containing Named Constants and FOL
inferred← citeshttps://doi.org/10.1016/j.hm.2019.10.001openalex-snapshot
Book Review
inferred← citeshttps://doi.org/10.1016/j.jal.2012.01.001openalex-snapshot
The Ackermann approach for modal logic, correspondence theory and second-order reduction
inferred← citeshttps://doi.org/10.1016/s1874-5857(04)80020-7openalex-snapshot
The Algebra of Logic
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70009-3openalex-snapshot
Jacques Herbrand: Life, Logic, and Automated Deduction
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70014-7openalex-snapshot
Gödel's Logic
inferred← citeshttps://doi.org/10.1017/9781316831809openalex-snapshot
The Significance of the New Logic
inferred← citeshttps://doi.org/10.1017/bsl.2015.10openalex-snapshot
HEINRICH BEHMANN’S 1921 LECTURE ON THE DECISION PROBLEM AND THE ALGEBRA OF LOGIC
inferred← citeshttps://doi.org/10.1017/s0960129500070079openalex-snapshot
Linear time computable problems and first-order descriptions
inferred← citeshttps://doi.org/10.1023/a:1026278800910openalex-snapshot
The Russellian Influence on Hilbert and his School
inferred← citeshttps://doi.org/10.1023/a:1026282901818openalex-snapshot
On the Meaning of Hilbert's Consistency Problem (Paris, 1900)
inferred← citeshttps://doi.org/10.1080/01445340.2013.816555openalex-snapshot
Completeness: from Gödel to Henkin
inferred← citeshttps://doi.org/10.1080/01445349708837283openalex-snapshot
Head or tail? de morgan on the bounds of traditional logic
inferred← citeshttps://doi.org/10.1090/s0002-9947-1964-0163837-5openalex-snapshot
Singulary cylindric and polyadic equality algebras
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780195137316.003.0029openalex-snapshot
The Development of Mathematical Logic from Russell to Tarski, 1900–1935
inferred← citeshttps://doi.org/10.1093/jigpal/jzab018openalex-snapshot
Undecidability of the Logic of Partial Quasiary Predicates
inferred← citeshttps://doi.org/10.1093/jigpal/jzx003openalex-snapshot
Minimizing disjunctive normal forms of pure first-order logic
inferred← citeshttps://doi.org/10.1093/logcom/exaa091openalex-snapshot
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exab030openalex-snapshot
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/philmat/nkaa036openalex-snapshot
Three Letters on the Foundations of Mathematics by Frank Plumpton Ramsey†
inferred← citeshttps://doi.org/10.11575/prism/38830openalex-snapshot
Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives
inferred← citeshttps://doi.org/10.1215/00294527-2020-0009openalex-snapshot
Formal Notes on the Substitutional Analysis of Logical Consequence
inferred← citeshttps://doi.org/10.17951/ai.2005.3.1.105-117openalex-snapshot
Decidability vs. undecidability. Logico-philosophico-historical remarks
inferred← citeshttps://doi.org/10.2178/bsl/1082986260openalex-snapshot
Predicative Fragments of Frege Arithmetic
inferred← citeshttps://doi.org/10.2178/bsl/1231081370openalex-snapshot
A Natural Axiomatization of Computability and Proof of Church's Thesis
inferred← citeshttps://doi.org/10.2307/2267689openalex-snapshot
Some theorems on definability and decidability
inferred← citeshttps://doi.org/10.2307/2273128openalex-snapshot
Logic in the twenties: the nature of the quantifier
inferred← citeshttps://doi.org/10.2307/2275098openalex-snapshot
Undecidability of modal and intermediate first-order logics with two individual variables
inferred← citeshttps://doi.org/10.2307/2964056openalex-snapshot
Two theories with axioms built by means of pleonasms
inferred← citeshttps://doi.org/10.2307/2964057openalex-snapshot
Decidability and essential undecidability
inferred← citeshttps://doi.org/10.2307/421074openalex-snapshot
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski
inferred← citeshttps://doi.org/10.2307/421183openalex-snapshot
Between Russell and Hilbert: Behmann on the Foundations of Mathematics
inferred← citeshttps://doi.org/10.2307/421184openalex-snapshot
Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic
inferred← citeshttps://doi.org/10.48550/arxiv.0902.4682openalex-snapshot
Lectures on Jacques Herbrand as a Logician
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02607openalex-snapshot
Characterization theorems for PDL and FO(TC)
inferred← citeshttps://doi.org/10.48550/arxiv.1712.06868openalex-snapshot
Heinrich Behmann's Contributions to Second-Order Quantifier Elimination from the View of Computational Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11137openalex-snapshot
PIE -- Proving, Interpolating and Eliminating on the Basis of First-Order Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11500openalex-snapshot
Separateness of Variables -- A Novel Perspective on Decidable First-Order Fragments
inferred← citeshttps://doi.org/10.48550/arxiv.2107.02333openalex-snapshot
Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)
inferred← citeshttps://doi.org/10.5642/jhummath.201901.05openalex-snapshot
From Solvability to Formal Decidability: Revisiting Hilbert’s “Non-Ignorabimus”
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.