scientific article; zbMATH DE number 3248792
From MaRDI portal
Publication:5537599
zbMath0155.01102MaRDI QIDQ5537599
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Computation of full logic programs using one-variable environments ⋮ The jump operation for structure degrees ⋮ A view of programming languages as symbiosis of meaning and computations ⋮ Inferences for numerical dependencies ⋮ Structured algebraic specifications: A kernel language ⋮ The reflective Milawa theorem prover is sound (down to the machine code that runs it) ⋮ Towards a trustworthy semantics-based language framework via proof generation ⋮ Incorporating equality into logic programming via surface deduction ⋮ Space- and time-dependent scaling of numbers in mathematical structures: effects on physical and geometric quantities ⋮ A simple dynamic logic ⋮ On methods for safe introduction of operations ⋮ Predicativity, the Russell-Myhill paradox, and Church's intensional logic ⋮ Domain-independent formulas and databases ⋮ Super-exponentials nonprimitive recursive, but rudimentary ⋮ Traditional logic, modern logic and natural language ⋮ Crypt-equivalent algebraic specifications ⋮ Some results and experiments in programming techniques for propositional logic ⋮ An application of Tarski's principle to absolute Galois groups of function fields ⋮ The logic of tied implications. II. Syntax ⋮ Effects of a scalar scaling field on quantum mechanics ⋮ An infinite version of Arrow's theorem in the effective setting ⋮ Some general incompleteness results for partial correctness logics ⋮ Partial Horn logic and Cartesian categories ⋮ Toposes and intuitionistic theories of types ⋮ Fuzzy inference in a formal theory of semantic equivalence ⋮ On the number of steps in proofs ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving ⋮ On interpretation of inconsistent theories ⋮ On the complexity of curve fitting algorithms ⋮ 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 ⋮ Geometric construction by assembling solved subfigures ⋮ A logical expression of reasoning ⋮ Contribution to the study of the natural number object in elementary topoi ⋮ On partitions of \(\mathbb E^n\) ⋮ An approach for data type specification and its use in program verification ⋮ There are four countable ultrahomogeneous graphs without triangles ⋮ Hierarchical program specification and verification - a many-sorted logical approach ⋮ Recursive assertions and parallel programs ⋮ On the proof-theory of two formalisations of modal first-order logic ⋮ Cellular objects and Shelah's singular compactness theorem ⋮ Levels of undecidability in rewriting ⋮ Non-recursiveness of the operations on real numbers ⋮ On the interpretability of arithmetic in temporal logic ⋮ Axioms and models of linear logic ⋮ A first order logic for partial functions ⋮ The Turing degrees for some computation model with the real parameter ⋮ Abduction in economics: a conceptual framework and its model ⋮ Fiber bundle description of number scaling in gauge theory and geometry ⋮ Topological complexity of locally finite \(\omega\)-languages ⋮ Query evaluation in probabilistic relational databases ⋮ On the Modularization Theorem for logical specifications ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Husserl and Hilbert on completeness, still ⋮ Complete axiomatizations of some quotient term algebras ⋮ Finite-model theory -- A personal perspective ⋮ On the axiom of union ⋮ On the completeness and decidability of duration calculus with iteration ⋮ Embedding and coding below a 1-generic degree ⋮ A functional interpretation for nonstandard arithmetic ⋮ Modal logics with several operators and probability interpretations ⋮ Abstract deduction and inferential models for type theory ⋮ Axioms for a theory of semantic equivalence ⋮ Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem ⋮ Some notes on truths and comprehension ⋮ Injecting uniformities into Peano arithmetic ⋮ The strength of extensionality. I: Weak weak set theories with infinity ⋮ On universal transfer learning ⋮ Wittgensteinian tableaux, identity, and co-denotation ⋮ Structure and transcendence degree of \(\eta_{\alpha +1}\)-fields and ultrapowers of fields ⋮ An analysis of first-order logics of probability ⋮ On universal Horn classes categorical in some infinite power ⋮ The relational model of data and cylindric algebras ⋮ Homogeneous and strictly homogeneous criteria for partial structures ⋮ From Hilbert's program to a logic tool box ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ A more complete model of communicating processes ⋮ On \(\aleph_ 0\)-categorical class two groups ⋮ Proving program inclusion using Hoare's logic ⋮ A view of computability on term algebras ⋮ The comparison of the expressive power of first-order dynamic logics ⋮ A probabilistic dynamic logic ⋮ Average case optimality for linear problems ⋮ Non-deterministic data types: Models and implementations ⋮ Random orders ⋮ Expressiveness and the completeness of Hoare's logic ⋮ A contribution to the theory of program testing ⋮ Countable algebra and set existence axioms ⋮ The undecidability of pseudo real closed fields ⋮ Classifying circular cellular automata ⋮ An essay in combinatory dynamic logic ⋮ The structure of the models of decidable monadic theories of graphs ⋮ Incomplete symbols -- definite descriptions revisited ⋮ On effectively computable realizations of choice functions ⋮ Conditional logic of actions and causation ⋮ A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction ⋮ Cut-elimination and quantification in canonical systems
This page was built for publication:
