On the public citation graph

Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…

https://doi.org/10.2307/2274155
0 signed · 769 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/(sici)1098-111x(199909)14:9<935::aid-int6>3.0.co;2-eopenalex-snapshot
Propositional fuzzy logics: Decidable for some (algebraic) operators; undecidable for more complicated ones
inferred← citeshttps://doi.org/10.1002/malq.19900360506openalex-snapshot
The hilbert type axiomatization of some three‐valued propositional logic
inferred← citeshttps://doi.org/10.1002/malq.200910106openalex-snapshot
On the computational content of the Bolzano-Weierstraß Principle
inferred← citeshttps://doi.org/10.1002/malq.201200001openalex-snapshot
On effective σ‐boundedness and σ‐compactness
inferred← citeshttps://doi.org/10.1006/inco.1998.2724openalex-snapshot
Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements
inferred← citeshttps://doi.org/10.1006/inco.1999.2792openalex-snapshot
Finite Queries Do Not Have Effective Syntax
inferred← citeshttps://doi.org/10.1006/inco.1999.2838openalex-snapshot
Sequentiality, Monadic Second-Order Logic and Tree Automata
inferred← citeshttps://doi.org/10.1006/inco.2001.2910openalex-snapshot
Induction by Enumeration
inferred← citeshttps://doi.org/10.1006/inco.2002.2955openalex-snapshot
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs
inferred← citeshttps://doi.org/10.1006/jcta.1998.2906openalex-snapshot
Regressive Ramsey Numbers Are Ackermannian
inferred← citeshttps://doi.org/10.1006/jcta.2000.3154openalex-snapshot
Long Finite Sequences
inferred← citeshttps://doi.org/10.1006/jsco.1999.0346openalex-snapshot
Program Development Schemata as Derived Rules
inferred← citeshttps://doi.org/10.1006/jsco.1999.0359openalex-snapshot
Cut-elimination and Redundancy-elimination by Resolution
inferred← citeshttps://doi.org/10.1007/1-4020-3521-7_1openalex-snapshot
The Practical Turn in Logic
inferred← citeshttps://doi.org/10.1007/1-4020-4101-2_7openalex-snapshot
Ramsey and the Vienna Circle on Logicism
inferred← citeshttps://doi.org/10.1007/1-4020-4631-6_2openalex-snapshot
A Logic for Inductive Probabilistic Reasoning
inferred← citeshttps://doi.org/10.1007/11528784_4openalex-snapshot
From Formal Concept Analysis to Contextual Logic
inferred← citeshttps://doi.org/10.1007/11552222_5openalex-snapshot
Ten Theses on Logic Languages for the Semantic Web
inferred← citeshttps://doi.org/10.1007/11554554_8openalex-snapshot
Cyclic Proofs for First-Order Logic with Inductive Definitions
inferred← citeshttps://doi.org/10.1007/11591191_45openalex-snapshot
Comparative Similarity, Tree Automata, and Diophantine Equations
inferred← citeshttps://doi.org/10.1007/11601548_11openalex-snapshot
Infinitary Rewriting: From Syntax to Semantics
inferred← citeshttps://doi.org/10.1007/11780342_9openalex-snapshot
Prefix-Like Complexities and Computability in the Limit
inferred← citeshttps://doi.org/10.1007/11881216_33openalex-snapshot
Mapping Conformant Planning into SAT Through Compilation and Projection
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_12openalex-snapshot
(Semi)-separability of finite sets of terms in Scott's D∞-models of the λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_3openalex-snapshot
A characterization of abstract data as model-theoretic invariants
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_40openalex-snapshot
Recursive programs as functions in a first order theory
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_22openalex-snapshot
Suggestions for composing and specifying program design decisions
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_4openalex-snapshot
Towards a theory of abstract data types: A discussion on problems and tools
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_15openalex-snapshot
The simple semantics for Coppo-Dezani-Sallé types
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_6openalex-snapshot
The semantics of second order polymorphic lambda calculus
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_62openalex-snapshot
Logical specification and implementation
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_5openalex-snapshot
Recursive definitions in type theory
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_94openalex-snapshot
Exponential time and bounded arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-29462-7_16openalex-snapshot
The P $$\mathop = \limits^? $$ NP-Problem: A View from the 1990s
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_21openalex-snapshot
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_18openalex-snapshot
Logic for Computer Science: The Engineering Challenge
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_40openalex-snapshot
Checking Amalgamability Conditions forCasl Architectural Specifications
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_20openalex-snapshot
On Barbed Equivalences in π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_4openalex-snapshot
The Expressive Power of Horn Monadic Linear Logic
inferred← citeshttps://doi.org/10.1007/3-540-45350-4_8openalex-snapshot
A New Termination Approach for Specialization
inferred← citeshttps://doi.org/10.1007/3-540-45368-7openalex-snapshot
Lectures on Information Retrieval
inferred← citeshttps://doi.org/10.1007/3-540-45368-7_9openalex-snapshot
Logic and Uncertainty in Information Retrieval
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_6openalex-snapshot
On Expressive and Model Checking Power of Propositional Program Logics
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_1openalex-snapshot
Little Engines of Proof
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_11openalex-snapshot
Meta-reasoning: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-45650-3_21openalex-snapshot
A General Theory of Deduction,Induction,and Learning
inferred← citeshttps://doi.org/10.1007/3-540-45758-5_11openalex-snapshot
Towards a Tailored Theory of Consistency Enforcement in Databases
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_33openalex-snapshot
Induction in the elementary theory of types and names
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_124openalex-snapshot
A modular framework for specification and implementation
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_142openalex-snapshot
Semi-constructive formal systems and axiomatization of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_37openalex-snapshot
Efficient decision procedures for locally finite theories II
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_19openalex-snapshot
A category of many-sorted algebraic theories which is equivalent to the category of categories with finite products
inferred← citeshttps://doi.org/10.1007/3-540-51251-9_8openalex-snapshot
Logical rewritings for improving the evaluation of quantified queries
inferred← citeshttps://doi.org/10.1007/3-540-53082-7_25openalex-snapshot
Properties and actions
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_57openalex-snapshot
A non-standard inductive semantics
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_3openalex-snapshot
The basic logic of proofs
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_85openalex-snapshot
Semantics for abstract clauses
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_17openalex-snapshot
A basis for a multilevel metalogic programming language
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_183openalex-snapshot
A note on the use of probabilities by mechanical learners
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_206openalex-snapshot
High undecidability of weak bisimilarity for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_8openalex-snapshot
Rewriting and tree automata
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_52openalex-snapshot
Deriving and applying logic program transformers
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_34openalex-snapshot
On the role of category theory in the area of algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_25openalex-snapshot
Informational logic for automated reasoning
inferred← citeshttps://doi.org/10.1007/3-540-62222-5_52openalex-snapshot
Expressive power of unary counters
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_30openalex-snapshot
Fast cut-elimination by projection
inferred← citeshttps://doi.org/10.1007/3-540-64823-2_5openalex-snapshot
Degrees of monotonicity of spatial transformations
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_10openalex-snapshot
The Unintended Interpretations of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_6openalex-snapshot
The Löwenheim-Skolem Theorem, Theories of Quantification, and Proof Theory
inferred← citeshttps://doi.org/10.1007/978-1-4020-2808-3_15openalex-snapshot
Quantum Logic and the Unity of Science
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_9openalex-snapshot
Spatial Logic + Temporal Logic = ?
inferred← citeshttps://doi.org/10.1007/978-1-4020-5764-9_9openalex-snapshot
Constructibility and Class Forcing
inferred← citeshttps://doi.org/10.1007/978-1-4020-8926-8_17openalex-snapshot
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-1-4020-9374-6_8openalex-snapshot
From Games to Dialogues and Back
inferred← citeshttps://doi.org/10.1007/978-1-4471-2173-2_2openalex-snapshot
Overture: Ramsey’s Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4471-3215-8_9openalex-snapshot
A Semantics for Locally Bottom-Avoiding Choice
inferred← citeshttps://doi.org/10.1007/978-1-4471-3554-8_5openalex-snapshot
A Semantic Model for Dynamic Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3573-9_6openalex-snapshot
A Tutorial on Co-induction and Functional Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-4616-2_11openalex-snapshot
The Fathers of Dimension
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_22openalex-snapshot
Some Other W[1] Hardness Results
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_19openalex-snapshot
Some Relations Between Subsystems of Arithmetic and Complexity of Computations
inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_10openalex-snapshot
Mechanizing Programming Logics in Higher Order Logic
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_25openalex-snapshot
An Equivalence between Polynomial Constructivity of Markov’s Principle and the Equality P=NP
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_28openalex-snapshot
Least Fixed Points in Preassociative Combinatory Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_19openalex-snapshot
Approximating the Projective Model
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_2openalex-snapshot
Facets of Incompleteness
inferred← citeshttps://doi.org/10.1007/978-1-4613-8601-8_6openalex-snapshot
Fixed Point Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_9openalex-snapshot
Reductions of Theories for Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-02777-3_25openalex-snapshot
Study on Destruction Transformation of Error System Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-15277-2_1openalex-snapshot
Interfaces of Incompleteness
inferred← citeshttps://doi.org/10.1007/978-3-030-56441-4_20openalex-snapshot
A Framework for Automated Testing
inferred← citeshttps://doi.org/10.1007/978-3-0348-0502-5_8openalex-snapshot
Test-space Characterizations of Some Classes of Banach Spaces
inferred← citeshttps://doi.org/10.1007/978-3-0348-8599-7_22openalex-snapshot
Eléments de la méthode de forcing dans quelques travaux de N. N. Lousin
inferred← citeshttps://doi.org/10.1007/978-3-0348-9259-9_11openalex-snapshot
Eine Verschärfung des Unvollständigkeitssatzes der Zahlentheorie
inferred← citeshttps://doi.org/10.1007/978-3-0348-9259-9_15openalex-snapshot
Modelle der Arithmetik
inferred← citeshttps://doi.org/10.1007/978-3-319-00119-7_4openalex-snapshot
Proofs of Impossibility
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_6openalex-snapshot
A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata
inferred← citeshttps://doi.org/10.1007/978-3-319-09719-0_10openalex-snapshot
Leon Henkin the Reviewer
inferred← citeshttps://doi.org/10.1007/978-3-319-10031-9_12openalex-snapshot
Construction and Constitution in Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_9openalex-snapshot
Goodstein’s Theorem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-11041-7_3openalex-snapshot
Explaining Deductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_11openalex-snapshot
First-Order Transitive Closure Axiomatization via Iterative Invariant Injections
inferred← citeshttps://doi.org/10.1007/978-3-319-48953-7_2openalex-snapshot
Intuitionistic Fuzzy Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-48953-7_4openalex-snapshot
Temporal and Multidimensional Intuitionistic Fuzzy Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-67398-1_18openalex-snapshot
The Wonder of Colors and the Principle of Ariadne
inferred← citeshttps://doi.org/10.1007/978-3-319-74718-7_7openalex-snapshot
Kurt Gödel: A Godfather of Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-319-95004-4_6openalex-snapshot
Second-Order Quantification
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_7openalex-snapshot
A Logic of Non-monotone Inductive Definitions and Its Modularity Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-24773-9_12openalex-snapshot
Observations on the Decidability of Transitions
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_1openalex-snapshot
Specifying Compositional Units for Correct Program Development in Computational Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_3openalex-snapshot
Formalizing Set Theory as it Is Actually Used
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_9openalex-snapshot
On Decidability of MSO Theories of Representable Matroids
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_38openalex-snapshot
Automated Generation of Analytic Calculi for Logics with Linearity
inferred← citeshttps://doi.org/10.1007/978-3-540-45062-7_46openalex-snapshot
A Sequent Calculus for Skeptical Reasoning in Predicate Default Logic (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_19openalex-snapshot
Refined Complexity Analysis of Cut Elimination
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_10openalex-snapshot
Nominal Inversion Principles
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_9openalex-snapshot
Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_14openalex-snapshot
The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_6openalex-snapshot
Formalised Inductive Reasoning in the Logic of Bunched Implications
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_11openalex-snapshot
A Formally Verified Prover for the $\mathcal{ALC\,}$ Description Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_6openalex-snapshot
Extending a Resolution Prover for Inequalities on Elementary Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_4openalex-snapshot
Symmetric Logic of Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_6openalex-snapshot
A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_18openalex-snapshot
The Microcosm Principle and Concurrency in Coalgebra
inferred← citeshttps://doi.org/10.1007/978-3-540-85565-1_65openalex-snapshot
A General Forward Reasoning Algorithm for Various Logic Systems with Different Formalizations
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_3openalex-snapshot
Trust and Automation in Verification Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-02264-7_33openalex-snapshot
Recombination Patterns for Natural Syntax
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_32openalex-snapshot
Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-03153-3_3openalex-snapshot
A Tutorial on Type-Based Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_11openalex-snapshot
Automating Theories in Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-11072-6_1openalex-snapshot
Admissible Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-12821-9_5openalex-snapshot
Geometry of Interaction and the Dynamics of Proof Reduction: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-19797-0_2openalex-snapshot
Semantic Web and Applied Informatics: Selected Research Activities in the Institute AIFB
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_11openalex-snapshot
Completions and Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/978-3-642-20267-4_29openalex-snapshot
Adaptive Finite Automaton: A New Algebraic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_12openalex-snapshot
Automated Cyclic Entailment Proofs in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-24544-2_18openalex-snapshot
A Complexity Theoretic View of Cities as Artefacts of Design Intentionality
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_7openalex-snapshot
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_1openalex-snapshot
Ordinal Analysis and the Infinite Ramsey Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_10openalex-snapshot
A Note on Ramsey Theorems and Turing Jumps
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_10openalex-snapshot
“Sphere to Cylinder”: Polar Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_11openalex-snapshot
“Sphere to Cylinder”: Transverse Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_12openalex-snapshot
“Sphere to Cylinder”: Oblique Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_13openalex-snapshot
“Sphere to Cylinder”: Pseudo-Cylindrical Projections
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_14openalex-snapshot
“Ellipsoid-of-Revolution to Cylinder”: Polar Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_15openalex-snapshot
“Ellipsoid-of-Revolution to Cylinder”: Transverse Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_16openalex-snapshot
“Ellipsoid-of-Revolution to Cylinder”: Oblique Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_22openalex-snapshot
Optimal Map Projections by Variational Calculus: Harmonic Maps
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_23openalex-snapshot
Map Projections of Alternative Structures: Torus, Hyperboloid, Paraboloid, Onion Shape and Others
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_24openalex-snapshot
C 10(3): The Ten Parameter Conformal Group as a Datum Transformation in Three-Dimensional Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_7openalex-snapshot
“Sphere to Tangential Plane”: Oblique Aspect
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_8openalex-snapshot
Ellipsoid-of-Revolution to Tangential Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-36494-5_9openalex-snapshot
Ellipsoid-of-Revolution to Sphere and from Sphere to Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-37067-0_8openalex-snapshot
New Structures Based on Completions
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_13openalex-snapshot
Small Induction Recursion
inferred← citeshttps://doi.org/10.1007/978-3-642-40948-6_15openalex-snapshot
Sequent Systems for Nondeterministic Propositional Logics without Reflexivity
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_29openalex-snapshot
Supercompilers - Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-642-46808-7_18openalex-snapshot
Conceptual Structures in Mathematical Logic and Their Formal Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-54936-6_1openalex-snapshot
Model Theory in Algebra, Analysis and Arithmetic: A Preface
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_10openalex-snapshot
Four Lectures on Primitive Recursion
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_4openalex-snapshot
Aspects of Classical Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-68929-1_12openalex-snapshot
Konkrete kombinatorische Algebren
inferred← citeshttps://doi.org/10.1007/978-3-642-69391-5_12openalex-snapshot
Logische Systeme und Repräsentationsprobleme
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_1openalex-snapshot
Introduction Ramsey Theory Old and New
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_16openalex-snapshot
Combinatorial Statements Independent of Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_7openalex-snapshot
Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-74688-8_12openalex-snapshot
An effective decision algorithm for prepositional temporal logic
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_4openalex-snapshot
Introduction au λ-calcul pur
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_6openalex-snapshot
Computability — Logical and Recursive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-84420-1_7openalex-snapshot
The Fundamental Structure of the Design Object Model
inferred← citeshttps://doi.org/10.1007/978-3-662-07413-8_3openalex-snapshot
Descriptive Set Theory and Topology
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_1openalex-snapshot
Complexity: A Language-Theoretic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-662-09691-8_18openalex-snapshot
Model Theory of Denotational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-12898-5openalex-snapshot
Recursion-Theoretic Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-7908-1770-6_6openalex-snapshot
On Efficient Representation of Expert Knowledge by Fuzzy Logic: Towards an Optimal Combination of Granularity and Higher-Order Approaches
inferred← citeshttps://doi.org/10.1007/978-3-7908-1840-6_13openalex-snapshot
Rough Sets and Rough Logic: A KDD Perspective
inferred← citeshttps://doi.org/10.1007/978-88-470-0784-0_13openalex-snapshot
Phenomenology of Incompleteness: From Formal Deductions to Mathematics and Physics
inferred← citeshttps://doi.org/10.1007/978-90-481-3529-5_6openalex-snapshot
Ω-Incompleteness, Truth, Intentionality
inferred← citeshttps://doi.org/10.1007/978-94-007-0080-2_1openalex-snapshot
What Is Mathematical Logic? A Survey
inferred← citeshttps://doi.org/10.1007/978-94-007-0214-1_15openalex-snapshot
Logic in Category Theory
inferred← citeshttps://doi.org/10.1007/978-94-007-0214-1_9openalex-snapshot
Paradox, ZF, and the Axiom of Foundation
inferred← citeshttps://doi.org/10.1007/978-94-007-0320-9_5openalex-snapshot
Reduction and Elimination
inferred← citeshttps://doi.org/10.1007/978-94-007-0431-2_9openalex-snapshot
Reflections on the Categorical Foundations of Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-007-4435-6_11openalex-snapshot
Program Testing and the Meaning Explanations of Intuitionistic Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-007-4435-6_3openalex-snapshot
Truth and Proof in Intuitionism
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_4openalex-snapshot
Natural Deduction for Equality: The Missing Entity
inferred← citeshttps://doi.org/10.1007/978-94-007-7759-0_11openalex-snapshot
Towards a Bayesian Theory of Second-Order Uncertainty: Lessons from Non-Standard Logics
inferred← citeshttps://doi.org/10.1007/978-94-009-0149-0_13openalex-snapshot
Admissible operations and product preserving functors
inferred← citeshttps://doi.org/10.1007/978-94-009-1902-0_12openalex-snapshot
Modal-Structural Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-009-2991-3_2openalex-snapshot
Cognition and the General Theory of Symbolic Expressions
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_2openalex-snapshot
Systems of Deduction
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-7798-3_9openalex-snapshot
Infinite Ordered Sets, A Recursive Perspective
inferred← citeshttps://doi.org/10.1007/978-94-009-8356-4_10openalex-snapshot
Philosophical aspects of proof theory
inferred← citeshttps://doi.org/10.1007/978-94-009-8489-9_6openalex-snapshot
Existentially Closed Projective Planes
inferred← citeshttps://doi.org/10.1007/978-94-009-9056-2_12openalex-snapshot
The Interplay Between Logic and Mathematics: Intuitionism
inferred← citeshttps://doi.org/10.1007/978-94-009-9056-2_5openalex-snapshot
Constructivist Approaches to Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-9825-4_1openalex-snapshot
Some Facts from the Theory of Proofs and Some Fictions from General Proof Theory
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_7openalex-snapshot
Naïve Computational Type Theory
showing the first 200 of 769 · page through all 769
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.