scientific article; zbMATH DE number 3467029
From MaRDI portal
Publication:4052072
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Model-theoretic algebra (03C60) Computability and recursion theory (03Dxx) Proof theory and constructive mathematics (03F99) Nonstandard models (03H99)
Cited in
(43)- Two types of deflationism
- Turing oracle machines, online computing, and three displacements in computability theory
- The unaxiomatizability of a quantified intensional logic
- Omega-consistency and the diamond
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
- Minimum-complexity pairing functions
- Representing the knowledge of Turing machines
- On theorems of Gödel and Kreisel: Completeness and Markov's principle
- Elementary realizability
- Inconsistent models of arithmetic. I: Finite models
- Index sets and presentations of complexity classes
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- NuMachine and NuAlgebra
- Truthmaker maximalism and the truthmaker paradox
- Complexity of the problem of being equivalent to Horn formulas
- The scope of Gödel's first incompleteness theorem
- Boolos and the metamathematics of Quine's definitions of logical truth and consequence
- Conservative extensions of models of set theory and generalizations
- In Memoriam: George Stephen Boolos 1940–1996
- Kleene's amazing second recursion theorem
- Denotation, paradox and multiple meanings
- Computing the maximum violation of a Bell inequality is an NP-problem
- Incompleteness in a General Setting
- Kleene’s Amazing Second Recursion Theorem
- On deciding the truth of certain statements involving the notion of consistency
- On first-order theories with provability operator
- Alonzo church:his life, his work and some of his miracles
- On quasitautologies
- DEPENDENT CHOICE, PROPERNESS, AND GENERIC ABSOLUTENESS
- SUFFICIENT CONDITIONS FOR THE EXISTENCE OF UNDECIDABLE INDIRECTLY REFLECTIVE SENTENCES
- The developments of the concept of machine computability from 1936 to the 1960s
- Symmetry's end?
- Computability and Recursion
- ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS
- Core Gödel
- Emergence, reduction and supervenience: a varied landscape
- The complexity of completions in partial combinatory algebra
- On a paradox of Hilbert and Bernays
- Chance and necessity: Hegel's epistemological vision
- Core Tarski and Core McGee
- Proving program inclusion using Hoare's logic
- Average case optimality for linear problems
- Amending Frege's \textit{Grundgesetze der Arithmetik}
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052072)
