scientific article; zbMATH DE number 3248792

Cited in

(only showing first 100 items - show all)

Eliminating disjunctions by disjunction elimination
The Turing degrees for some computation model with the real parameter
Recursive assertions and parallel programs
A resolution principle for constrained logics
A contribution to the theory of program testing
The equivalence of Horn and network complexity for Boolean functions
Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006
Turing oracle machines, online computing, and three displacements in computability theory
Axioms and models of linear logic
Remarks on Herbrand normal forms and Herbrand realizations
A logical expression of reasoning
Proof theory in the abstract
Computation of full logic programs using one-variable environments
One Useful Logic That Defines Its Own Truth
The abstract type of the real numbers
A more complete model of communicating processes
On the desirability of mechanizing calculational proofs
A view of programming languages as symbiosis of meaning and computations
Topological complexity of locally finite \(\omega\)-languages
Non-recursiveness of the operations on real numbers
From Hilbert's program to a logic tool box
Real-valued multisets and fuzzy sets
Borel preference orders in markets with a continuum of traders
Models of arithmetic and recursive functions
The Boone-Higman theorem and the conjugacy problem
Nonstandardness and the bounded functional interpretation
Mechanizing \(\omega\)-order type theory through unification
A first order logic for partial functions (extended abstract)
Completeness problems in classes of computable named functions
On universal transfer learning
On expandability of models of Peano arithmetic. I
Wittgensteinian tableaux, identity, and co-denotation
Undecidability and Definability for the Theory of Global Fields
A logical theory of robot problem solving
On the duality of abduction and model generation in a framework for model generation with equality
Uniformization in a playful universe
There are four countable ultrahomogeneous graphs without triangles
On the complexity of curve fitting algorithms
Mathematical quantum theory. I: Random ultrafilters as hidden variables
Crypt-equivalent algebraic specifications
Intuitionist type theory and the free topos
The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
Super-exponentials nonprimitive recursive, but rudimentary
COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
Some general incompleteness results for partial correctness logics
Geometric construction by assembling solved subfigures
From mathesis universalis to provability, computability, and constructivity
Varieties of Pluralism and Objectivity in Mathematics
scientific article; zbMATH DE number 3501750 (Why is no real title available?)
Left termination turned into termination
On the axiom of union
Equivalence of recursive specifications in process algebra
Eliminating disjunctions by disjunction elimination
A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
When do two Banach spaces have isometrically isomorphic nonstandard hulls
Abduction: a categorical characterization
A structural operational semantics for an Edison like language. II
Interval logics with applications to study of tense and aspect in English
Finite-model theory -- A personal perspective
Functional interpretation of Aczel's constructive set theory
Existentially closed fields with \(G\)-derivations
Intuitionistic propositional logic is polynomial-space complete
Cut-elimination and quantification in canonical systems
Complexity, decidability and undecidability results for domain-independent planning
Concrete categories and infinitary languages
On definite program answers and least Herbrand models
scientific article; zbMATH DE number 3523536 (Why is no real title available?)
Space- and time-dependent scaling of numbers in mathematical structures: effects on physical and geometric quantities
Cellular objects and Shelah's singular compactness theorem
On methods for safe introduction of operations
Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen
Homogeneous and strictly homogeneous criteria for partial structures
An essay in combinatory dynamic logic
Non-reflexive logical foundation for quantum mechanics
Non-elementary speed-ups in logic calculi
Hierarchies and reducibilities on regular languages related to modulo counting
Countable algebra and set existence axioms
The relational model of data and cylindric algebras
Non-commutative first-order EQ-logics
Average case optimality for linear problems
PARADIGM, FORMAL PROPERTIES AND LIMITS OF FUZZY LOGIC
Random orders
Nonstandard hulls of Banach spaces
A logic for reasoning about probabilities
Dependent choice, `quote' and the clock
\(\aleph_0\)-categorical stable groups
Finitely Many Primitive Positive Clones
On pushout consistency, modularity and interpolation for logical specifications
Some results and experiments in programming techniques for propositional logic
On partitions of \(\mathbb E^n\)
What is a logic translation?
Different senses of finitude: an inquiry into Hilbert's finitism
Partial Horn logic and Cartesian categories
scientific article; zbMATH DE number 3335898 (Why is no real title available?)
The iterative conception of set. A (bi-)modal axiomatisation
Domain-independent formulas and databases
``Inference versus consequence revisited: inference, consequence, conditional, implication
A comprehensive picture of the decidability of mereological theories
The logic of tied implications. II. Syntax
The strength of extensionality. I: Weak weak set theories with infinity

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)