scientific article; zbMATH DE number 3241254
From MaRDI portal
zbMath0149.24309MaRDI QIDQ5528627
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The cylindric algebras of three-valued logic, On primitive recursive permutations and their inverses, Nonisomorphism of lattices of recursively enumerable sets, Logical Operations and Inference in the Complex s-Logic, Morphismes sur le Système des Opérateurs propositionnels, Eliminating the continuum hypothesis, Herbrand style proof procedures for modal logic, Applications of Strict Π11 predicates to infinitary logic, On strongly minimal sets, On a Π01 Set of Positive Measure, On analytic well-orderings, Élimination des quantificateurs dans des paires de corps, LINEAR TIME IN HYPERSEQUENT FRAMEWORK, Analyzing natural languages: antimems, contradictions, and onthologies, On extensibility of proof checkers, The nature of entailment: an informational approach, On the incompleteness theorems, The decision problem for effective procedures, Seven Kinds of Computable and Constructive Infelicities in Economics, Cut elimination by unthreading, Complementary proof nets for classical logic, Upper and lower bounds for the height of proofs in sequent calculus for intuitionistic logic, FRACTIONAL-VALUED MODAL LOGIC, A step towards absolute versions of metamathematical results, A transfinite sequence of ω-models, Second Thoughts on the Second Law, Confidence and discoveries with \(e\)-values, Metalogic, Schopenhauer and Universal Logic, Minimal readability of intuitionistic arithmetic and elementary analysis, Almost strongly minimal theories. I, The Mathematical Development of Set Theory from Cantor to Cohen, Bimodal logics for extensions of arithmetical theories, An addition to Rosser's theorem, Generalized interpolation theorems, Computability and Recursion, Program derivation with verified transformations — a case study, In Praise of Replacement, Step by Recursive Step: Church's Analysis of Effective Calculability, Unnamed Item, Why Turing’s Thesis Is Not a Thesis, Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic, Weak cardinality theorems, Logical Oppositions in Arabic Logic: Avicenna and Averroes, FORMALIZATION, PRIMITIVE CONCEPTS, AND PURITY, Alonzo church:his life, his work and some of his miracles, VON NEUMANN’S CONSISTENCY PROOF, MORITA EQUIVALENCE, Note on generalized atomic sets of formulas, On the possibility of a Σ21well-ordering of the Baire space, Existentially closed structures, On the first-order logic of terms, An application of Σ40 determinacy to the degrees of unsolvability, Freeness in classes without equality, 2003 Annual Meeting of the Association for Symbolic Logic, Transfinite Progressions: A Second Look at Completeness, INTELLIGENT SYSTEMS: KNOWLEDGE ASSOCIATION AND RELATED DEDUCTIVE PROCESSES, Gödel, Tarski, Church, and The Liar, 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02, Uniform upper bounds on ideals of turing degrees, A characterization of companionable, universal theories, Ordinals connected with formal theories for transfinitely iterated inductive definitions, A DRIVEN IFS REPRESENTATION OF TURING MACHINES, Axiomatization of non-associative generalisations of Hájek's BL and psBL, The perfect set theorem and definable wellorderings of the continuum, Partially ordered interpretations, Meeting of the Association for Symbolic Logic, Metainferential duality, Explicit mathematics with the monotone fixed point principle, On the computational content of the axiom of choice, The Developments of the Concept of Machine Computability from 1936 to the 1960s, Natural Deduction for Equality: The Missing Entity, The isomorphism property in nonstandard analysis and its use in the theory of Banach spaces, Normalization Proof for Derivations in PA after P. Cohen, The lazy logic of partial terms, Functional equations for the functions of real variables, Saturated models of Peano arithmetic, Finitely generic models of TUH, for certain model companionable theories T, Soundness and completeness proofs by coinductive methods, On Metapaths in Metagraphs, Gödel's incompleteness theorem, Contraction of Dirac matrices via chord diagrams, A normal form for logical derivations implying one for arithmetic derivations, Interpolation systems for ground proofs in automated deduction: a survey, Cut elimination for GLS using the terminability of its regress process, The axiom of determinacy implies dependent choices in L(R), Argumentation update in YALLA (yet another logic language for argumentation), Succinct definitions in the first order theory of graphs, A note on cut-elimination for classical propositional logic, On the metamathematics of the P vs. NP question, Dynamic controllability via timed game automata, FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE, Unnamed Item, Semantics of quantum programming languages: Classical control, quantum control, Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991, Informal versus formal mathematics, A boundedness theorem in ID1(W), First-degree entailment and its relatives, An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty, Prolegomena to a theory of mechanized formal reasoning, A sequent calculus for a negative free logic, Unnamed Item, A self-referential agent-based model that consists of a large number of agents moving stochastically in a discrete bounded domain., von Neumann standard quantum mechanics is logically inconsistent, Languages of logic and their applications, How to progress a database, Solvable classes of pseudoprenex formulas, On projective ordinals, König's Infinity Lemma and Beth's Tree Theorem, Axiomatic data type specifications: A first order theory of linear lists, On cut elimination in the presence of perice rule, Consequences of an exotic definition for \(\text{P}=\text{NP}\)., Continuity and elementary logic, Note on the Kondo-Addison theorem, Two-sided sequent calculi for \textit{FDE}-like four-valued logics, Some results in modal model theory, The isomorphism property in nonstandard analysis and its use in the theory of Banach spaces, Disjunctive closures for knowledge compilation, Believing the axioms. II, Reduction of tense logic to modal logic. I, On Generalized Decision Functions: Reducts, Networks and Ensembles, Lost in translation: language independence in propositional logic -- application to belief change, An intensional type theory: motivation and cut-elimination, First-Degree Entailment and Structural Reasoning, Estimating the number of steps that it takes to solve some problems of pattern recognition which admit logical description, Semi-minimal theories and categoricity, Self-verifying axiom systems, the incompleteness theorem and related reflection principles, Existential instantiation and normalization in sequent natural deduction, The connection between two ways of reasoning about partial functions, Metamodeling semantics of multiple inheritance, Axioms for the set-theoretic hierarchy, European Summer Meeting of the Association for Symbolic Logic, Hull, 1986, Modal analysis of generalized rosser sentences, Forcing and reducibilities, Regaining cut admissibility in deduction modulo using abstract completion, The work of Kurt Gödel, Fragment of Nonstandard Analysis with a Finitary Consistency Proof, The theory of all substructures of a structure: Characterisation and decision problems, Quantifier-complete categories, Theories with a finite number of countable models, A Natural Axiomatization of Computability and Proof of Church's Thesis, On rewriting sentences into formulas, Model companions and k-model completeness for the complete theories of Boolean algebras, FRACTIONAL SEMANTICS FOR CLASSICAL LOGIC, Normality, non-contamination and logical depth in classical natural deduction, Saturation and Σ2-transfer for ERNA, A note on inverses of elementary permutations, Index set expressions can represent temporal logic formulas, Turing oracle machines, online computing, and three displacements in computability theory, Conditions for Lyapunov stability, Possible worlds and resources: The semantics of \(\mathbf{BI}\), We shall know: Hilbert's apology, Automating Theories in Intuitionistic Logic, Heirs of box types in polynomially bounded structures, Mass Problems and Measure-Theoretic Regularity, Abstract Beth definability in institutions, Extended normal form theorems for logical proofs from axioms, Some Fixed-Point Issues in PPTL, Grammar directed gödel numberings, A logic covering undefinedness in program proofs, The knowing mathematician, Solving strong controllability of temporal problems with uncertainty using SMT, The metamathematics of model theory: Discovering language in action, Shoenfield is Gödel after Krivine, On generalized quantifiers in arithmetic, Cuts, consistency statements and interpretations, A note on interpretations of many-sorted theories, TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS, The reachability problem in constructive geometric constraint solving based dynamic geometry, The logic and meaning of plurals. I, Formal systems for join dependencies, Equality and lyndon's interpolation theorem, Forcing and reducibilities. III. Forcing in fragments of set theory, On effectively computable realizations of choice functions, Groundwork for weak analysis