scientific article; zbMATH DE number 3248792

Cited in

(only showing first 100 items - show all)

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
The structure of the models of decidable monadic theories of graphs
A reducibility for the dot-depth hierarchy
On local modularity variants and \(\Pi\)-institutions
An axiomatic approach to forcing and generic extensions
Incomplete symbols -- definite descriptions revisited
Predicativity, the Russell-Myhill paradox, and Church's intensional logic
On a Notion of Smallness for Subsets of the Baire Space
Inferences for numerical dependencies
On the interpretability of arithmetic in temporal logic
A semantical framework for supporting subjective and conditional probabilities in deductive databases
scientific article; zbMATH DE number 4156411 (Why is no real title available?)
Herbrand theorems in arbitrary institutions
Euclidean Ramsey theorems. I
On interpreting Chaitin's incompleteness theorem
(A-)synchronous (non)-deterministic cell spaces simulating each other
Splitting bisimulations and retrospective conditions
Fiber bundle description of number scaling in gauge theory and geometry
Husserl and Hilbert on completeness, still
scientific article; zbMATH DE number 5306054 (Why is no real title available?)
Arrays of prime ideals in commutative rings.
On a generalized modularization theorem
Traditional logic, modern logic and natural language
Probabilistic logic programming
The polynomial-time hierarchy
Effects of a scalar scaling field on quantum mechanics
Abduction in economics: a conceptual framework and its model
Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem
On the number of steps in proofs
Mathematical modal logic: A view of its evolution
Sets Definable Over Finite Fields: Their Zeta-Functions
On the Modularization Theorem for logical specifications
A first order logic for partial functions
An analysis of first-order logics of probability
On winning strategies in Ehrenfeucht-Fraïssé games
Proving partial order properties
A probabilistic dynamic logic
Fine hierarchies and m-reducibilities in theoretical computer science
Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
ConGolog, a concurrent programming language based on the situation calculus
A simple type theory with partial functions and subtypes
A remark on equivalent Rosser sentences
The reflective Milawa theorem prover is sound (down to the machine code that runs it)
Expressiveness and the completeness of Hoare's logic
Modal logics with several operators and probability interpretations
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

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)