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)
- 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\)
- Existentially closed fields withG-derivations
- 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
- Non-elementary speed-ups in logic calculi
- On the interpretability of arithmetic in temporal logic
- The relational model of data and cylindric algebras
- Splitting bisimulations and retrospective conditions
- On a generalized modularization theorem
- The polynomial-time hierarchy
- An analysis of first-order logics of probability
- Some results and experiments in programming techniques for propositional logic
- Mathematical modal logic: A view of its evolution
- On pushout consistency, modularity and interpolation for logical specifications
- Proving partial order properties
- PARADIGM, FORMAL PROPERTIES AND LIMITS OF FUZZY LOGIC
- Average case optimality for linear problems
- Probabilistic logic programming
- Effects of a scalar scaling field on quantum mechanics
- The reflective Milawa theorem prover is sound (down to the machine code that runs it)
- A logic for reasoning about probabilities
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem
- An essay in combinatory dynamic logic
- Functional interpretation of Aczel's constructive set theory
- On a Notion of Smallness for Subsets of the Baire Space
- Abduction in economics: a conceptual framework and its model
- On definite program answers and least Herbrand models
- An axiomatic approach to forcing and generic extensions
- What is a logic translation?
- The strength of extensionality. I: Weak weak set theories with infinity
- A reducibility for the dot-depth hierarchy
- Complexity, decidability and undecidability results for domain-independent planning
- ConGolog, a concurrent programming language based on the situation calculus
- Title not available (Why is that?)
- Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
- Different senses of finitude: an inquiry into Hilbert's finitism
- The iterative conception of set. A (bi-)modal axiomatisation
- ``Inference versus consequence revisited: inference, consequence, conditional, implication
- A comprehensive picture of the decidability of mereological theories
- A simple type theory with partial functions and subtypes
- Husserl and Hilbert on completeness, still
- Finitely Many Primitive Positive Clones
- Non-reflexive logical foundation for quantum mechanics
- Dependent choice, `quote' and the clock
- Traditional logic, modern logic and natural language
- Sets Definable Over Finite Fields: Their Zeta-Functions
- 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
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)
