scientific article; zbMATH DE number 3073037

zbMath0047.00703MaRDI QIDQ5812175

Stephen C. Kleene

Publication date: 1952

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

philosophy and foundations of mathematics

Related Items

On hyperarithmetical realizability, Informational semantics, non-deterministic matrices and feasible deduction, On all strong Kleene generalizations of classical logic, Arithmetical realizability and basic logic, Nice embedding in classical logic, Correia semantics revisited, The Lambek calculus extended with intuitionistic propositional logic, Hypersequent rules with restricted contexts for propositional modal logics, Editors' introduction: The third life of quantum logic: Quantum logic inspired by quantum computing, On truth-gaps, bipolar belief and the assertability of vague propositions, The paraconsistent logic of quantum superpositions, Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic, What is the world of mathematics?, Propositional logic for topology-like matrices: A calculus with restricted substitution, Different senses of finitude: an inquiry into Hilbert's finitism, A short proof of Glivenko theorems for intermediate predicate logics, Does the deduction theorem fail for modal logic?, Three-valued logics in modal logic, The FE-closure operator in countable-valued logic, Semantics and proof-theory of depth bounded Boolean logics, Intuitionistic completeness of first-order logic, Abstract Hilbertian deductive systems, infon logic, and Datalog, A bipolar model of assertability and belief, On the proof-theory of two formalisations of modal first-order logic, Gradualness, uncertainty and bipolarity: making sense of fuzzy sets, Closed choice and a uniform low basis theorem, Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, Maximal and premaximal paraconsistency in the framework of three-valued semantics, Constructive semantics for instantaneous reactions, Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\), Sequential and distributed on-the-fly computation of weak tau-confluence, Recursive analysis of singular ordinary differential equations, A bipolar model of vague concepts based on random set and prototype theory, Some axioms for constructive analysis, Constructive Boolean circuits and the exactness of timed ternary simulation, Ideal paraconsistent logics, Relational semantics of the Lambek calculus extended with classical propositional logic, Editorial: Weighted logics for artificial intelligence -- an introductory discussion, Borderline vs. unknown: comparing three-valued representations of imperfect information, On truth-gaps, truth-gluts, and bipolar propositions, Characterizations of semicomputable sets of real numbers, A note on admissible rules and the disjunction property in intermediate logics, An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion, A constructive version of Tarski's geometry, On Beall's new interpretation of \(WK_{3}\), Pragmatic interpretations of vague expressions: strongest meaning and nonmonotonic consequence, A map of dependencies among three-valued logics, Most general first order theorems are not recursively enumerable, Intensional aspects of function definitions, Partial functions and logics: A warning, Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves, Interpolants, cut elimination and flow graphs for the propositional calculus, Duality for semilattice representations, On a paradox of Hilbert and Bernays, Decision-theoretic three-way approximations of fuzzy sets, Relations in operational categories, A three-way approach for learning rules in automatic knowledge-based topic models, Conflicting accounts of \(\lambda\)-definability, Remark on Kreisel's conjecture, Skeptical reason maintenance and belief revision, Logical foundations for programming semantics, A logic for category theory, Power domains and second-order predicates, Acquiring search-control knowledge via static analysis, Notes on computable analysis, Functional interpretations of feasibly constructive arithmetic, A reasoning method for a paraconsistent logic, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, On list primitive recursion and the complexity of computing inf, Complexity of subclasses of the intuitionistic propositional calculus, A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete, On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis, Adas and the equational theory of if-then-else, Theory of semi-instantiation in abstract argumentation, Recognition complexity of theories and their computational expressivity, On the simple substitution property for superintuitionistic and modal propositional logics, On the algorithmic complexity of static structures, On partial and paraconsistent logics, CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks, Fixing Zeno gaps, Continuity of operators on continuous and discrete time streams, First-order reasoning and primitive recursive natural number notations, A theorem on the consistency of circumscription, On the expressive power of schemes, Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets, Exception tracking in an open world, The \(\lambda \)-calculus and the unity of structural proof theory, The computational status of physics, A class of reversible primitive recursive functions, Real numbers, continued fractions and complexity classes, Data types over multiple-valued logics, Negation in rule-based database languages: A survey, Functorial polymorphism, On disjunctions and existential statements in intuitionistic systems of logic, Computable probability spaces, Notes on synonymy, An enumeration of the primitive recursive functions without repetition, On free modular lattices. II, Incomplete symbols -- definite descriptions revisited, A framework for compositional verification of multi-valued systems via abstraction-refinement, A relative interpolation theorem for infinitary universal Horn logic and its applications, Structured algebraic specifications: A kernel language, A theory for nondeterminism, parallelism, communication, and concurrency, De Morgan clones and four-valued logics, Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation, Uniform normal form for general time-bounded complexity classes, States on semi-divisible generalized residuated lattices reduce to states on MV-algebras, On superintuitionistic logics as fragments of proof logic extensions, Partial models and logic programming, Fuzzy constructive logic, The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem, Expressibility in the elementary theory of recursively enumerable sets with realizability logic, Characteristics of graph languages generated by edge replacement, Equational specification of partial higher-order algebras, Nonconstructivizability of certain ordered fields of real numbers, The programming system PRIZ, The linear abstract machine, Lower bounds on degrees of game-theoretic structures, The semantics and proof theory of linear logic, The calculus of constructions, Explanation-based generalisation \(=\) partial evaluation, Data structures for symbolic multi-valued model-checking, Innovations in computational type theory using Nuprl, Two classes of intermediate propositional logics without disjunction property, Basic intuitionistic principles in fuzzy set theories and its extensions (a terminological debate on Atanassov IFS), Computability of analog networks, The power of temporal proofs, On the number of steps in proofs, On interpretation of inconsistent theories, Completeness proofs for propositional logic with polynomial-time connectives, Bilattices and the theory of truth, Nested recursion, Knuth's iterated powers, Sentence, proposition and identity, The persistent homology of a self-map, Partially additive categories and flow-diagram semantics, From types to sets, Formalization of equivalence of recursively defined functions, An informational view of classical logic, Approximability of operators in constructive metric spaces, Continuity of operators in separable constructive metric spaces, Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks, Intuitionist type theory and the free topos, A note on three-valued logic and Tarski theorem on truth definitions, Axiomatic data type specifications: A first order theory of linear lists, The independence of control structures in abstract programming systems, Remarks on recursion versus diagonalization and exponentially difficult problems, Proof-theoretical analysis: Weak systems of functions and classes, Do-it-yourself type theory, Mixed computation and compilation: New approaches to old problems, The algebra of conditional logic, Programs and program verifications in a general setting, Unprovability of theorems of complexity theory in weak number theories, A first order logic for partial functions, The consistency of some intuitionistic and constructive principles with a set theory, Lower bounds for increasing complexity of derivations after cut elimination, Canonical recursive functions and operations, Mixed computation: potential applications and problems for study, Learning with belief levels, A functorial framework for constraint normal logic programming, Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions, Formal axiomatic theories based on a three-valued logic, Algebras of recursively enumerable sets and their applications to fuzzy logic, Primitive recursive selection functions for existential assertions over abstract algebras, Läuchli's completeness theorem from a topos-theoretic perspective, Necessary limits to knowledge: Unknowable truths, Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus, Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems, Rough sets and 3-valued logics, From word to sentence: a pregroup analysis of the object pronoun \textit{who(m)}, Coherence in linear predicate logic, Proof systems for reasoning about computation errors, Truth values, neither-true-nor-false, and supervaluations, Two types of deflationism, Turing oracle machines, online computing, and three displacements in computability theory, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Constructing shadowed sets and three-way approximations of fuzzy sets, Formal notes on the substitutional analysis of logical consequence, Cut elimination for \(\mathrm{S4}_n\) and \(\mathrm{K4}_n\) with the central agent axiom, Physicalism, instrumentalism and the semantics of modal logic, A logic covering undefinedness in program proofs, All solutions of a system of recursion equations in infinite trees and other contraction theories, Implementation of data types by algebraic methods, Enumerating fuzzy switching functions and free Kleene algebras, The undecidability of the preperfectness of Thue systems, Paradox, truth and logic. I. Paradox and truth, On the fixpoints of nondeterministic recursive definitions, On some proof theoretical properties of the modal logic GL, Closure functions and general iterates as reflectors, Variations on da Costa C systems and dual-intuitionistic logics. I: Analyses of \(C_{\omega}\) and \(CC_{\omega}\), Optimal fixedpoints of logic programs, Terminological difficulties in fuzzy set theory -- the case of ``intuitionistic fuzzy sets, Complex structures and composite models - An essay on methodology, Double-negation elimination in some propositional logics, On effectively computable realizations of choice functions, Type 2 recursion theory, Least reflexive points of relations, An exactification of the monoid of primitive recursive functions, Admissibility of cut in LC with fixed point combinator, Constructibility of the universal wave function, Arithmetical realizability and primitive recursive realizability, Some generalizations of the calculus of binary events, Computable processes and bisimulation equivalence, Bounded model checking of infinite state systems, Metodo di assiomatizzazione in senso stretto della meccanica classica. Applicazione di esso ad alcuni problemi di assiomatizzazione non ancora completamente risolti, Operational semantics of resolution and productivity in Horn clause logic, The intuitionistic fragment of computability logic at the propositional level, Gödel on deduction, Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited, Is there a ``Hilbert thesis?, Inference as doxastic agency. I: The basics of justification stit logic, Tableaux and restricted quantification for systems related to weak Kleene logic, Borderlines and probabilities of borderlines: on the interconnection between vagueness and uncertainty, Effectivity questions for Kleene's recursion theorem, A two-valued logic for reasoning about different types of consequence in Kleene's three-valued logic, Constructive and mechanised meta-theory of intuitionistic epistemic logic, Conway's work on iteration, Shadowed sets with higher approximation regions, Paraconsistent metatheory: new proofs with old tools, A modal view on resource-bounded propositional logics, Reasoning about ignorance and contradiction: many-valued logics versus epistemic logic, Abstraction and pattern classification, Zur Theorie der konstruktiven Wohlordnungen, Constructive theory of enumerable species, Partial arithmetical data types of rational numbers and their equational specification, Generic Kleene fixed point theorem, Correspondence analysis and automated proof-searching for first degree entailment, McCarthy-Kleene fuzzy automata and MSO logics, A metatheory of a mechanized object theory, MTV logics, Bilateralism, trilateralism, multilateralism and poly-sequents, A three-valued Fregean quantification logic, A duality for involutive bisemilattices, Proof theory of paraconsistent weak Kleene logic, Modular proof systems for partial functions with Evans equality, The class of all natural implicative expansions of Kleene's strong logic functionally equivalent to Łukasiewicz's 3-valued logic Ł3, Discovering knowability: a semantic analysis, Satisfiability in composition-nominative logics, A QBF-based formalization of abstract argumentation semantics, Logics of left variable inclusion and Płonka sums of matrices, Probability, fuzziness and borderline cases, Structure of the rational monoid algebra for Boolean matrices of order 3, Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability, A class of implicative expansions of Kleene's strong logic, a subclass of which is shown functionally complete via the precompleteness of Łukasiewicz's 3-valued logic Ł3, Proof-theoretic semantics and inquisitive logic, Cut rule for the resolution method, Beyond Rasiowan systems: unital deductive systems, The scope of Gödel's first incompleteness theorem, A dissimilarity-based framework for generating inconsistency-tolerant logics, On the unity of duality, Models of computation for partial functions on the reals, A survey of nonstandard sequent calculi, Reductions, completeness and the hardness of approximability, A new concept of predicative truth and definability, A proof of Hume's separation thesis based on a formal system for descriptive and normative statements, Static analysis of topology-dependent broadcast networks, Distance-based paraconsistent logics, Functional parallel typified language and its implementation on clusters, Universes of fuzzy sets and axiomatizations of fuzzy set theory. I: Model-based and axiomatic approaches, Using Ramsey's theorem once, Justified common knowledge, From truth to computability. I., Referential logic of proofs, On interplay of quantifiers in Gödel-Dummett fuzzy logics, Algebraic correctness proofs for compiling recursive function definitions with strictness information, Eigenvariables, bracketing and the decidability of positive minimal predicate logic, Characterizing the continuous degrees, The harmony of identity, A survey of predicate realizability logic, Generalized realizability for extensions of the language of arithmetic, Failure of completeness in proof-theoretic semantics, Missing values and dragonfly operations in fuzzy relational compositions, Towards a theory of semantics and compilers for programming languages, Some applications of Gentzens second consistency proof, Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class, On the structure of \(C\)-algebras through atomicity and \texttt{if-then-else}, Examples of varieties of semigroups, The lambda-gamma calculus: A language adequate for defining recursive functions, A variation of Richter's construction of ordinals, Subrecursive programming languages. II. On program size, On the reducibility of \(\Pi_ 1^ 1\) sets, A note on inverses of elementary permutations, Conditions for Lyapunov stability, Computer proofs of limit theorems, Absolute \(L\)-realizability and intuitionistic logic, Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law, Completeness of calculii for axiomatically defined classes of algebras, On the generative power of transformational grammars, On the realizations of predicate formulas, A weakening of intuitionistic logic, Quantifier-free and one-quantifier systems, A pseudofundamental sequence that is not equivalent to any monotone sequence, A class of realizable propositional formulas, Measuring coherence using LP-models, Diagonal fixed points in algebraic recursion theory, A new proof of Ajtai's completeness theorem for nonstandard finite structures, Non-reflexive logical foundation for quantum mechanics, \(L\)-fuzzy syntopogenous structures. I: Fundamentals and application to \(L\)-fuzzy topologies, \(L\)-fuzzy proximities and \(L\)-fuzzy uniformities, An alternative normalization of the implicative fragment of classical logic, Condition/decision duality and the internal logic of extensive restriction categories, A strong induction scheme that leads to polynomially computable realizations, On some generalizations of the primitive recursive arithmetic, Dualities for Płonka sums, Pecularities of some three- and four-valued second order logics, Second-order logic of paradox, \(L\)-fuzzy sets and isomorphic lattices: are all the ``new results really new?, Peano's axioms in their historical context, An approach to uncertainty via sets of truth values, Implementation of the composition-nominative approach to program formalization in Mizar, Some lattice models of bilinear logic, On constructivity and the Rosser property: a closer look at some Gödelean proofs, Hintikka's independence-friendly logic meets Nelson's realizability, A finitely axiomatized formalization of predicate calculus with equality, Epsilon substitution method for elementary analysis, Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm, Verified iptables firewall analysis and verification, Normal forms for second-order logic over finite structures, and classification of NP optimization problems, A classical view of the intuitionistic continuum, Realizing Brouwer's sequences, Computation on abstract data types. The extensional approach, with an application to streams, Self-extensional three-valued paraconsistent logics, On fixed-point theorems in synthetic computability, Some general results about proof normalization, An algebraic view of super-Belnap logics, Cut elimination, identity elimination, and interpolation in super-Belnap logics, First-degree entailment and its relatives, Interpolation methods for Dunn logics and their extensions, A note on freedom from detachment in the logic of paradox, A more general general proof theory, The never-ending recursion, Meaning explanations at higher dimension, Intuitionism and effective descriptive set theory, Brouwer and Euclid, Natural deduction for Fitting's four-valued generalizations of Kleene's logics, Glivenko theorems and negative translations in substructural predicate logics, Reprint of: ``A more general general proof theory, Defeasible inheritance on cyclic networks, Dijkstra, Floyd and Warshall meet Kleene, Jean van Heijenoort's contributions to proof theory and its history, Omnipresence, multipresence and ubiquity: kinds of generality in and around mathematics and logics, Synonymous logics, Density of the cototal enumeration degrees, Unified grounding, Vagueness and aggregation in multiple sender channels, Multivalent semantics for vagueness and presupposition, Diversification of object-languages for propositional logics, Contradictory information: too much of a good thing, Computable preference and utility, A binary modal logic for the intersection types of lambda-calculus., Concerning existential definition of the class \(NP\): Theoretical analysis of an alternative approach, Things that can and things that cannot be done in PRA, A semantic hierarchy for intuitionistic logic, Stone-type representations and dualities for varieties of bisemilattices, The fixed point problem of a simple reversible language, Polynomial-time algorithms for computing distances of fuzzy transition systems, Evaluation functions and decision conditions of three-way decisions with game-theoretic rough sets, A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information, A core model for choreographic programming, Is there any real substance to the claims for a ``new computationalism?, Multiplication and comultiplication of beliefs, Fuzzy sets and formal logics, A system for deduction-based formal verification of workflow-oriented software models, Logics of nonsense and Parry systems, Some computational aspects of metric fixed-point theory, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, Kleene algebra of partial predicates, Multi-functional nearest-neighbour classification, Analogy calculus, On the elimination of imaginaries from certain valued fields, The origins of the halting problem, Time and logic: A calculus of binary events, Randomized proofs in arithmetic, Remarks on Herbrand normal forms and Herbrand realizations, A unary representation result for system \(T\), Specialisation calculus and communication, Incompleteness and the halting problem, Intuitionism: an inspiration?, Quasi-minimal enumeration degrees and minimal Turing degrees, Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion, Meaningless divisions, What is a (non-constructive) non-monotone logical system?, Meaning-preserving translations of non-classical logics into classical logic: between pluralism and monism, Reduction of finite and infinite derivations, Completeness of Hoare-calculi revisited, Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras, A strong completeness theorem in intuitionistic quantified modal logic, Constructions and negationless logic, A formalization of the propositional calculus of H-B logic, Some problems of completeness of arithmetic, An equational variant of Lawvere's natural numbers object, A predicative and decidable characterization of the polynomial classes of languages, Foundations of programmology, Structural cut elimination. I: Intuitionistic and classical logic, Kleene's Logic with equality, Fixpoint semantics for logic programming a survey, On the desirability of mechanizing calculational proofs, Minkowski-Lyapunov functions: alternative characterization and implicit representation, Minimum classical extensions of constructive theories, Péter on Church's thesis, constructivity and computers, Strict Fregean free logic, A direct method for simulating partial recursive functions by Diophantine equations, Embedment of a fuzzy logic system into a Boolean lattice for satisfying a complementary law, Some descriptive-set-theoretical problems in complexity theory, Correctness of fixpoint transformations, Induction and foundation in the theory of hereditarily finite sets, Gödel's incompleteness theorem, A kind of logical compilation for knowledge bases, A three-valued semantics for deductive databases and logic programs, Equational derivation vs. computation, Proof strategies in linear logic, Logics and quantum gravity, Embedding complex decision procedures inside an interactive theorem prover., The Kreisel length-of-proof problem, A constructive game semantics for the language of linear logic, Elementary realizability, Indexed systems of sequents and cut-elimination, Intuitionistic formal theories with realizability in subrecursive classes, Incompleteness in a topos, A first order logic of effects, Generalized computations and second degree arithmetic, A self-referential agent-based model that consists of a large number of agents moving stochastically in a discrete bounded domain., Hoare's logic and Peano's arithmetic, About primitive recursive algorithms, Arithmetical set theory, Three-valued nonmonotonic formalisms and semantics of logic programs, A simple fixed point characterization of three-valued stable model semantics, Effective oracles, Myhill's work in recursion theory, Map theory, A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses, On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making, Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games, Modal translations in substructural logics, Constructing type systems over an operational semantics, A theory of abstraction, Equivalence-preserving first-order unfold/fold transformation systems, The \(n\)-rea enumeration degrees are dense, On arithmetic complexity of certain constructive logics, On representation of finite pseudo-Boolean algebras and one of its applications, Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi, Logic, sets, and mathematics, Linearizing intuitionistic implication, Translations and structure for partial propositional calculi, On computability with functionals, Vagueness, truth and logic, Augmented loop languages and classes of computable functions, A generalization of Lyndon's theorem characterizing sentences preserved in subdirect products, Logical foundations of applied mathematics, The logical meaning of programs of a subrecursive language, Holographic or Fourier logic, Experimental tests of resolution-based theorem-proving strategies, Least fixed points revisited, Provability interpretations of modal logic, Computability concepts for programming language semantics, On the completeness of the inductive assertion method, Equational axioms for classes of Heyting algebras, Semantical analyses of propositional systems of Fitch and Nelson, Intuitionistic logic with strong negation, On certain theorems of analysis in the formal system Kleene-Vesley, PASCAL in LCF: Semantics and examples of proof, A specialization of the form of deductions in Gentzen calculi and its applications, Topological variants of the continuity theorem for mappings and related theorems, Constructive operators of finite types, Families of recursive predicates of measure zero, A propositional fragment of Lesniewski's ontology, Data types, abstract data types and their specification problem, Finite investigations of transfinite derivations, Transfinite expansions of arithmetic formulas, The convergence of functions to fixedpoints of recursive definitions, E theorems, From what does the law of the excluded middle follow?, Some properties of mappings of sheaf-spaces, A hierarchy of Brouwer constructive functionals, The theory of empirical sequences, A generalized setting for fixpoint theory, Intuitionistic propositional logic is polynomial-space complete, Partial logics reconsidered: A conservative approach, Paraconsistent logic programming, A note on complexity measures for inductive classes in constructive type theory, Modified realizability and predicate logic, Representing scope in intuitionistic deductions, From environments to representations -- a mathematical theory of artificial perceptions, A semantics for modular general logic programs, System \(T\), call-by-value and the minimum problem, Permutability of proofs in intuitionistic sequent calculi, The reception of Frege's \textit{Begriffsschrift}, We shall know: Hilbert's apology, Separability of normalizable superintuitionistic propositional logics, On approximate and algebraic computability over the real numbers, An implementation of Kripke-Kleene semantics, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, A common axiom set for classical and intuitionistic plane geometry, Definitional equivalence and algebraizability of generalized logical systems, Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory, Quantified Quinean \(S5\), Computational foundations of basic recursive function theory, A type-theoretical alternative to ISWIM, CUCH, OWHY, Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications, Are the traditional philosophies of mathematics really incompatible?, Charakterisierung der Aufzählungsreduzierbarkeit, HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION, Turing Machines for Dummies, Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs, Composing models, ARITHMETIC MEAN BASED COMPENSATORY FUZZY LOGIC, A Fortuitous Year with Leon Henkin, Henkin’s Theorem in Textbooks, Linear Nested Sequents, 2-Sequents and Hypersequents, Mīmāṃsā Deontic Logic: Proof Theory and Applications, Truth and the Liar, König's lemma, the ω-Rule and primitive recursive arithmetic, Anmerkungen zum Rekursionstheorem, Herbrand semantics, the potential infinite, and ontology-free logic, Three-Valued Logics for Incomplete Information and Epistemic Logic, The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics, LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC, A Denotational Semantic Theory of Concurrent Systems, Verificationism and the principle of non-contradiction, Positive Arithmetic Without Exchange Is a Subclassical Logic, Hierarchies of number-theoretic predicates, Unnamed Item, On the cut operation in Gentzen calculi, On the Divergence of Extension Procedures in Isol Theory, The Birth of Model Checking, Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül, Towards a Historical Notion of ‘Turing—the Father of Computer Science’, Continuity in Semantic Theories of Programming, Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem, Mind the Croc! Rationality Gaps vis-à-vis the Crocodile Paradox, Boolos and the Metamathematics of Quine's Definitions of Logical Truth and Consequence, Varianten von Turingmaschinen, Can Church's thesis be viewed as a Carnapian explication?, Disjunctive properties of intuitionistic systems, Neutral free logic: motivation, proof theory and models, Provability logic: models within models in Peano arithmetic, Unnamed Item, Proposal for a natural formalization of functional programming concepts, On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$, On understanding understanding, A meta-logic of inference rules: Syntax, Partial and paraconsistent three-valued logics, On the Semantics of Intensionality, The theory of transfinite recursion, The Ω-consistency of ramified analysis, Über die Verallgemeinerung der Theorie der Rekursiven Funktionen für Abstrakte Mengen Geeigneter Struktur als Definitionsbereiche, Anticipation and dynamics: Rosen's anticipation in the perspective of time, Kripke semantics for the logic of problems and propositions, Hyperarithmetical Sets, Why Post Did [Not Have Turing’s Thesis], Intuitionistic Decision Procedures Since Gentzen, FDE as the One True Logic, K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You, GP’s LP, Unnamed Item, The PRIZ system and propositional calculus, Constructive mathematical descriptions of subject domains, Russell's theory of types, 1901–1910: its complex origins in the unpublished manuscripts, A Brief History of Natural Deduction, Domains of Sciences, Universes of Discourse and Omega Arguments, Constructivity in Geometry, Logic Semantics with the Potential Infinite, Monotone Relations, Fixed Points and Recursive Definitions, Formalization of correctness of recursive definitions, Satisfaction and Friendliness Relations within Classical Logic: Proof-Theoretic Approach, On the Complexity of Semantic Self-minimization, Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers), Property Driven Three-Valued Model Checking on Hybrid Automata, Degrees of Computability, Arithmetical Predicates and Function Quantifiers, Reasoning with different levels of uncertainty, Incompleteness, Undecidability and Automated Proofs, Unnamed Item, Current methods for proving program correctness, A decompositional deduction system for a logic featuring inconsistency and uncertainty, Analytical tableaux for da Costa's hierarchy of paraconsistent logics C<sub>n</sub>, 1≤n<ω, The modalized Heyting calculus: a conservative modal extension of the Intuitionistic Logic ★, ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE†, Recursive and Recursively Enumerable Orders, Some Theorems on Classes of Recursively Enumerable Sets, Unnamed Item, On a Subrecursive Hierarchy and Primitive Recursive Degrees, A Theorem on General Recursive Functions, Recursive Functions Over Well Ordered Partial Orderings, Note on Degrees of Partial Functions, The logic of interactive turing reduction, Constructive Versions of Ordinal Number Classes, Quantifier probability logic and the confirmation paradox, Classes of Predictably Computable Functions, Schemata: The Concept of Schema in the History of Logic, UN-KLEENE BOOLEAN EQUATION SOLVING, On the Computational Representation of Classical Logical Connectives, Constructive Analogues of the Group of Permutations of the Natural Numbers, AUTOLOGY OF TIME*, The theory of recursive functions, approaching its centennial, The compactness of first-order logic:from gödel to lindström, TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS, ON THE FOUNDATIONS OF MATHEMATICAL ECONOMICS, REFLECTIONS ON MATHEMATICAL ECONOMICS IN THE ALGORITHMIC MODE, Unnamed Item, ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT, Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory, A Generalization of Falsity in Finitely-many Valued Logics, Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond, Unnamed Item, What is the Church-Turing Thesis?, Unnamed Item, Hilbert’s Axiomatisches Denken, Unnamed Item, Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus, Unnamed Item, Unnamed Item, Pure Variable Inclusion Logics, MATHEMATICAL INFERENCE AND LOGICAL INFERENCE, Note on a six-valued extension of three-valued logic, New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory, HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?, A NOTE ON THE SEQUENT CALCULI, On the structure of kripke models of heyting arithmetic, Reasoning without believing: on the mechanisation of presuppositions and partiality, A modal theorem-preserving translation of a class of three-valued logics of incomplete information, Foreword: Three-valued logics and their applications, Modeling the suppression task under weak completion and well-founded semantics, Some remarks on certain trivalent accounts of presupposition projection, Trivalent logics arising from L-models for the Lambek calculus with constants, The defective conditional in mathematics, Proving termination of general Prolog programs, Defining LFIs and LFUs in extensions of infectious logics, Semantics of templates in a compositional framework for building logics, The KB paradigm and its application to interactive configuration, Computation over algebraic structures and a classification of undecidable problems, Unnamed Item, Unnamed Item, Syntax and Semantics in Higher-Type Recursion Theory, RECONSTRUCTION OF G. SPENCER BROWN'S THEME, INTUITIONISTIC ANALYSIS AT THE END OF TIME, On Priest's logic of paradox, Paul of Venice and Realist Developments of Roger Swyneshed's Treatment of Semantic Paradoxes, Some Weak Variants of the Existence and Disjunction Properties in Intermediate Predicate Logics, Recursive data structures, Unnamed Item, Many-Valued Logics in the Iberian Peninsula, Unnamed Item, Unnamed Item, Unnamed Item, Modal Tree‐Sequents, Two kinds of non-monotonic analogical inference, Plausible reasoning: a first-order approach, Conceptual Confluence in 1936: Post and Turing, Theses for Computation and Recursion on Concrete and Abstract Structures, Generalizing Computability Theory to Abstract Algebras, Semantics-to-Syntax Analyses of Algorithms, Proving Things About the Informal, Why Turing’s Thesis Is Not a Thesis, Efficient loop-check for backward proof search in some non-classical propositional logics, Assertions and recursions, Classical and constructive hierarchies in extended intuitionistic analysis, New Arguments for Adaptive Logics as Unifying Frame for the Defeasible Handling of Inconsistency, The Different Ways in which Logic is (said to be) Formal, Unnamed Item, Pluralism in Logic: The Square of Opposition, Leibniz’ Principle of Sufficient Reason and Markov’s Principle, Model-Checking View-Based Partial Specifications, Head or tail? de morgan on the bounds of traditional logic, Alonzo church:his life, his work and some of his miracles, Primitive Recursiveness of Real Numbers under Different Representations, Cut Elimination in a Class of Sequent Calculi for Pure Type Systems, Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic, Syntax and semantics of universal programming languages, Unnamed Item, A logic stronger than intuitionism, Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen, THE TERNARY DESCRIPTION LANGUAGE AS A FORMALISM FOR THE PARAMETRIC GENERAL SYSTEMS THEORY: PART 1, Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence, SOME FOUNDATIONAL VIEWS ON GENERAL SYSTEMS AND THE HEMPEL PARADOX, Regular bilattices, Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions, The programming system PRIZ, Recursively enumerable sets and degrees, Identities in Implicative Semilattices, Consistency proof without transfinite induction for a formal system for turing machines, Notes on Hazard-Free Circuits, A note on entropy of logic, Logics of variable inclusion and the lattice of consequence relations, Reducing Ordinal Recursion, The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian, Exactly true and non-falsity logics meeting infectious ones, Categoricity, THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH, DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV, REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION, Unnamed Item, Dialogue Games for Minimal Logic, Aspects of Categorical Recursion Theory, An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics, Sets of Formulas Valid in Finite Structures, Relativization of the Theory of Computational Complexity, HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC, Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics, Prädikatenlogik mit partiell definierten Funktionen II, An extension of the Kreisel-Putnam system, Should Deflationists Be Dialetheists?, Zur axiomatisierbarkeit von theorien in der schwachen logik der zweiten stufe, A complete classification of the Δ₂¹-functions, Boolean elements in Lukasiewicz algebras, I, Multiple Conclusion Rules in Logics with the Disjunction Property, Sequent Calculus for Intuitionistic Epistemic Logic IEL, Deductive systems and categories, A universal compiler system based on production rules, Some results in the effective descriptive set theory, Dialogspiele als Semantische Grundlage von Logikkalkülen, Semi-effective numberings and definitions of the computable numbers, Über Eine Prädikatenlogik mit Partiell Definierten Prädikaten und Funktionen, Unnamed Item, Ackermann's model and recursive predicates, Non-uniqueness at ω2 in Kleene'sO, Trial and error predicates and the solution to a problem of Mostowski, Decision procedures for S3∘ and S4∘, Constructive order types, III, Sur Le Schéma de la Séparation, Degrees of unsolvability of continuous functions, On complete degrees, A generalization of Curry's theorem, On a set theory suggested by Dedecker and Ehresmann, II, The Conjugacy Problem in Wreath Products and Free Metabelian Groups, On the Degrees of Index Sets, Prädikatenlogik mit partiell definierten Funktionen, Logic Programs under Three-Valued Łukasiewicz Semantics, A Simple Set Which is Not Effectively Simple, Hierarchies over recursive well-orderings, On families of sets represented in theories, Number theoretic concepts and recursive well-orderings, On Creative Sets and Indices of Partial Recursive Functions, Hyperanalytic Predicates, Isomorphism Types of Index Sets of Partial Recursive Functions, An Equivalence Between Nonassociative Ring Theory and the Theory of a Special Class of Groups, On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics, Broadening Label-Based Argumentation Semantics with May-Must Scales, THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY, ON NON-MONOTONOUS PROPERTIES OF SOME CLASSICAL AND NONCLASSICAL PROPOSITIONAL PROOF SYSTEMS, Two, Many, and Differently Many, On the Metamathematics of Rings and Integral Domains, Unnamed Item, On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs, Generalizable Kleene Logics, Computable Algebraic Structures and Nonstandard Arithmetic, The Kleene Hierarchy Classification of Recursively Random Sequences, Elementary Differences Between the Isols and the Co-Simple Isols, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Unnamed Item, Metalogic, Schopenhauer and Universal Logic, Hierarchies of Effective Descriptive Set Theory, Unnamed Item, Effectively Simple Sets, Unnamed Item, An Investigation into Intuitionistic Logic with Identity, Commutativity and Common Fixed Points in Recursion Theory, Unnamed Item, A UNIFIED THEORY OF TRUTH AND PARADOX, Unnamed Item, On Minimal and Almost-Minimal Systems of Notations, Recursive Functions Defined by Ordinal Recursions, Representability of Partial Recursive Functions in Formal Theories, Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation, LP<sup>+</sup>, K3<sup>+</sup>, FDE<sup>+</sup>, AND THEIR ‘CLASSICAL COLLAPSE’, A SIMPLE APPROACH TOWARDS RECAPTURING CONSISTENT THEORIES IN PARACONSISTENT SETTINGS, A constructive semantics for non‐deducibility, Symmetric Logic of Proofs, The Cantor–Bernstein theorem: how many proofs?, Kalmár's Argument Against the Plausibility of Church's Thesis, Stoic Sequent Logic and Proof Theory, A mechanization of strong Kleene logic for partial functions, Constructive Embedding from Extensions of Logics of Strict Implication into Modal Logics, Why Paraconsistent Logics?, Putnam’s Theorem on the Complexity of Models, Lattice NExtS4 from the Embedding Theorem Viewpoint, Feferman on Computability, The Interpretation Existence Lemma, Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis, Reconstructor: a computer program that uses three-valued logics to represent lack of information in empirical scientific contexts, Перспективы метаматематических структур в науке, MARKOV’S PRINCIPLE AND SUBSYSTEMS OF INTUITIONISTIC ANALYSIS, On Semantic Gamification, On abstraction and the expressive power of programming languages, Equational closure, The Emergence of Fuzzy Sets: A Historical Perspective, A New–old Characterisation of Logical Knowledge, Three-Valued Logic for Reasoning about Covering-Based Rough Sets, Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session, The Developments of the Concept of Machine Computability from 1936 to the 1960s, Approximation Schemes in Logic and Artificial Intelligence, Program Testing and the Meaning Explanations of Intuitionistic Type Theory, Metarecursively enumerable sets and admissible ordinals, Über die Bestimmbarkeit des Verhaltens von Algorithmen, La théorie des fonctions récursives et ses applications. (Exposé d'information générale), Metarecursive sets, Axiomatization of if-then-else over possibly non-halting programs and tests, The separable axiomatization of the intermediate propositional systems $S_n $ of Gödel, Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis, Functions of Propositions, THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC, Propositional Calculus and Realizability, THE LATTICE OF SUPER-BELNAP LOGICS, V. Yankov’s Contributions to Propositional Logic, A Note on Disjunction and Existence Properties in Predicate Extensions of Intuitionistic Logic—An Application of Jankov Formulas to Predicate Logics, On boolean functions and connected sets, Logische Kategorien, Subrecursiveness: Machine-independent notions of computability in restricted time and storage, The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework), An Arithmetically Complete Predicate Modal Logic, Mehrsortige logische Systeme mit unendlich langen Formeln I, Fibered universal algebra for first-order logics, SUBATOMIC INFERENCES: AN INFERENTIALIST SEMANTICS FOR ATOMICS, PREDICATES, AND NAMES, A new methodology for solving fuzzy systems of equations: thick fuzzy sets based approach, On Signings and the Well-Founded Semantics, Strict finitism and feasibility, Expressing computational complexity in constructive type theory, GÖDEL ON MANY-VALUED LOGIC, Semantics for abstract clauses, Unnamed Item, The dependence of computability on numerical notations, (Meta)inferential levels of entailment beyond the Tarskian paradigm, Speech acts in mathematics, Explainability of probabilistic bisimilarity distances for labelled Markov chains, A generalized cost-sensitive model for decision-theoretic three-way approximation of fuzzy sets, An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information, Folding left and right matters: Direct style, accumulators, and continuations, Core Gödel, A completeness proof for a regular predicate logic with undefined truth value, The decision problem for effective procedures, Recursively enumerable classes and their application to recursive sequences of formal theories, Eager Equality for Rational Number Arithmetic, Aggregation operators on shadowed sets, MAXIMALITY OF LOGIC WITHOUT IDENTITY, There are no minimal effectively inseparable theories, Classical (co)recursion: Mechanics, Raising awareness without disclosing truth, On the three-valued expansions of Kleene's logic, Truth meets vagueness. Unifying the semantic and the soritical paradoxes, How much partiality is needed for a theory of computability?, Cardinality reduction theorem for logics QHC and QH4, A step towards absolute versions of metamathematical results, Inferential constants, Non-transitive correspondence analysis, A formal theory of choreographic programming, A capacity-based semantics for inconsistency-tolerant inferences, A logical modeling of severe ignorance, Williamson's abductive case for the material conditional account, Equations for if-then-else, Two quantum logics of indeterminacy, Weak Kleene and other weak logics of conditionals, The liar paradox and ``meaningless revenge, Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability, A negative solution to Ono's problem P52: existence and disjunction properties in intermediate predicate logics, Hierarchies in Recursive Function Theory, An automatic proof of Gödel's incompleteness theorem, Word Problem for Ringoids of Numerical Functions, The Family of all Recursively Enumerable Classes of Finite Sets, On Hierarchies and Systems of Notations, An automatic proof of Gödel's incompleteness theorem, Some forms of completeness, Representability op recursively enumerable sets in formal theories, Church’s thesis and its relation to the concept of realizability in biology and physics, 1 — Consistency and faithful interpretations, Non-deterministic structures of computation, Full abstraction for expressiveness: history, myths and facts, Semantical analysis of weak Kleene logics, Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values, Idempotent full paraconsistent negations are not algebraizable, Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule, Probabilistic Recursive Functions, Unnamed Item, Unnamed Item, Unnamed Item, An introduction to compositional methods for concurrency and their application to real-time., Intrinsic reasoning about functional programs. I: First order theories, Analyzing realizability by Troelstra's methods, Arithmetic complexity of the predicate logics of certain complete arithmetic theories, Dual realizability in symmetric logic, Logical operations and Kolmogorov complexity, Distinguishability of a Semi-Group by a Machine, Creativity and Effective Inseparability, Recursive Enumerability and the Jump Operator, Exact Separation of Recursively Enumerable Sets Within Theories, A theorem about infinite-valued sentential logic, Neo-Logicism and Its Logic