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
- Incomplete symbols -- definite descriptions revisited
- Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen
- The structure of the models of decidable monadic theories of graphs
- Title not available (Why is that?)
- Interval logics with applications to study of tense and aspect in English
- Cellular objects and Shelah's singular compactness theorem
- Hierarchies and reducibilities on regular languages related to modulo counting
- Arrays of prime ideals in commutative rings.
- Countable algebra and set existence axioms
- Title not available (Why is that?)
- Herbrand theorems in arbitrary institutions
- On the number of steps in proofs
- A remark on equivalent Rosser sentences
- Nonstandard hulls of Banach spaces
- \(\aleph_0\)-categorical stable groups
- On interpreting Chaitin's incompleteness theorem
- Finite-model theory -- A personal perspective
- Random orders
- Intuitionistic propositional logic is polynomial-space complete
- On partitions of \(\mathbb E^n\)
- The logic of tied implications. II. Syntax
- Non-commutative first-order EQ-logics
- Domain-independent formulas and databases
- Title not available (Why is that?)
- On local modularity variants and \(\Pi\)-institutions
- A first order logic for partial functions
- Space- and time-dependent scaling of numbers in mathematical structures: effects on physical and geometric quantities
- On methods for safe introduction of operations
- Homogeneous and strictly homogeneous criteria for partial structures
- Inferences for numerical dependencies
- A probabilistic dynamic logic
- Expressiveness and the completeness of Hoare's logic
- Cut-elimination and quantification in canonical systems
- Concrete categories and infinitary languages
- Partial Horn logic and Cartesian categories
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Fiber bundle description of number scaling in gauge theory and geometry
- Fine hierarchies and m-reducibilities in theoretical computer science
- Predicativity, the Russell-Myhill paradox, and Church's intensional logic
- Euclidean Ramsey theorems. I
- On the Modularization Theorem for logical specifications
- On winning strategies in Ehrenfeucht-Fraïssé games
- Modal logics with several operators and probability interpretations
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)
