scientific article; zbMATH DE number 3248792
From MaRDI portal
Publication:5537599
zbMATH Open0155.01102MaRDI QIDQ5537599FDOQ5537599
Authors: Joseph R. Shoenfield 
Publication date: 1967
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Nonstandardness and the bounded functional interpretation
- On the axiom of union
- A structural operational semantics for an Edison like language. II
- On the desirability of mechanizing calculational proofs
- Crypt-equivalent algebraic specifications
- Super-exponentials nonprimitive recursive, but rudimentary
- Title not available (Why is that?)
- Recursive assertions and parallel programs
- Remarks on Herbrand normal forms and Herbrand realizations
- One Useful Logic That Defines Its Own Truth
- Borel preference orders in markets with a continuum of traders
- A logical theory of robot problem solving
- Some general incompleteness results for partial correctness logics
- Geometric construction by assembling solved subfigures
- On expandability of models of Peano arithmetic. I
- Real-valued multisets and fuzzy sets
- Varieties of Pluralism and Objectivity in Mathematics
- Mathematical quantum theory. I: Random ultrafilters as hidden variables
- Left termination turned into termination
- Proof theory in the abstract
- Undecidability and Definability for the Theory of Global Fields
- On the complexity of curve fitting algorithms
- Equivalence of recursive specifications in process algebra
- On the duality of abduction and model generation in a framework for model generation with equality
- From mathesis universalis to provability, computability, and constructivity
- The abstract type of the real numbers
- Completeness problems in classes of computable named functions
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006
- A logical expression of reasoning
- On universal transfer learning
- Wittgensteinian tableaux, identity, and co-denotation
- When do two Banach spaces have isometrically isomorphic nonstandard hulls
- From Hilbert's program to a logic tool box
- Models of arithmetic and recursive functions
- The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
- Turing oracle machines, online computing, and three displacements in computability theory
- A first order logic for partial functions (extended abstract)
- The equivalence of Horn and network complexity for Boolean functions
- Non-recursiveness of the operations on real numbers
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- A more complete model of communicating processes
- Axioms and models of linear logic
- Mechanizing \(\omega\)-order type theory through unification
- A resolution principle for constrained logics
- A contribution to the theory of program testing
- Intuitionist type theory and the free topos
- Abduction: a categorical characterization
- The Turing degrees for some computation model with the real parameter
- Uniformization in a playful universe
- There are four countable ultrahomogeneous graphs without triangles
- The Boone-Higman theorem and the conjugacy problem
- Eliminating disjunctions by disjunction elimination
- Eliminating disjunctions by disjunction elimination
- Computation of full logic programs using one-variable environments
- A view of programming languages as symbiosis of meaning and computations
- Topological complexity of locally finite \(\omega\)-languages
- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
- Locally finite languages
- Fuzzy inference in a formal theory of semantic equivalence
- On interpretation of inconsistent theories
- In Praise of Numerical Computation
- Complete axiomatizations of some quotient term algebras
- Taking formalism seriously
- Towards a trustworthy semantics-based language framework via proof generation
- Specifications, models, and implementations of data abstractions
- Query evaluation in probabilistic relational databases
- A non-reified temporal logic
- The closure of monadic NP
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Incorporating equality into logic programming via surface deduction
- Fuzzy logic programming
- Logic, sets, and mathematics
- Complexity of Gödel’s T in λ-Formulation
- The Theory of Countable Analytical Sets
- Fuzzy control from the logical point of view
- A functional interpretation for nonstandard arithmetic
- Classifying circular cellular automata
- Degrees of Undecidability in Term Rewriting
- On the completeness and decidability of duration calculus with iteration
- Embedding and coding below a 1-generic degree
- An application of Tarski's principle to absolute Galois groups of function fields
- Lectures on the model theory of valued fields
- Injecting uniformities into Peano arithmetic
- Some notes on truths and comprehension
- Structured algebraic specifications: A kernel language
- Glymour and Quine on theoretical equivalence
- An infinite version of Arrow's theorem in the effective setting
- Axioms for a theory of semantic equivalence
- On universal Horn classes categorical in some infinite power
- Non-deterministic data types: Models and implementations
- The undecidability of pseudo real closed fields
- On effectively computable realizations of choice functions
- A simple dynamic logic
- Precipitous ideals and \(\sum^1_4\) sets
- Decidability in elementary analysis. I
- Controlled query evaluation with open queries for a decidable relational submodel
- Definability and decidability in infinite algebraic extensions
- Well-structured mathematical logic
- On the proof-theory of two formalisations of modal first-order logic
- Structure and transcendence degree of \(\eta_{\alpha +1}\)-fields and ultrapowers of fields
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 Q5537599)
