scientific article; zbMATH DE number 3248792

Cited in

(only showing first 100 items - show all)

On the completeness and decidability of duration calculus with iteration
Embedding and coding below a 1-generic degree
Proving program inclusion using Hoare's logic
The comparison of the expressive power of first-order dynamic logics
Precipitous ideals and \(\sum^1_4\) sets
Logic, sets, and mathematics
Lectures on the model theory of valued fields
Levels of undecidability in rewriting
Complexity of Gödel’s T in λ-Formulation
An application of Tarski's principle to absolute Galois groups of function fields
Axioms for a theory of semantic equivalence
Krivine's intuitionistic proof of classical completeness (for countable languages)
First order logic with empty structures
The closure of monadic NP
Locally finite languages
Towards a trustworthy semantics-based language framework via proof generation
scientific article; zbMATH DE number 3814949 (Why is no real title available?)
Abstract deduction and inferential models for type theory
Incorporating equality into logic programming via surface deduction
On the proof-theory of two formalisations of modal first-order logic
A view of computability on term algebras
Hoare's logic for nondeterministic regular programs: A nonstandard approach
scientific article; zbMATH DE number 1154174 (Why is no real title available?)
Structure and transcendence degree of \(\eta_{\alpha +1}\)-fields and ultrapowers of fields
On \(\aleph_ 0\)-categorical class two groups
The Theory of Countable Analytical Sets
Fuzzy logic programming
Non-deterministic data types: Models and implementations
Definability and decidability in infinite algebraic extensions
Conditional logic of actions and causation
The jump operation for structure degrees
The undecidability of pseudo real closed fields
Finiteness is mu-ineffable
Fuzzy control from the logical point of view
In Praise of Numerical Computation
Complete axiomatizations of some quotient term algebras
On effectively computable realizations of choice functions
On Measurability and Regularity
A constructive valuation semantics for classical logic
Fuzzy inference in a formal theory of semantic equivalence
On interpretation of inconsistent theories
Injecting uniformities into Peano arithmetic
A simple dynamic logic
A functional interpretation for nonstandard arithmetic
On some classes of interpretations
Some notes on truths and comprehension
Well-structured mathematical logic
Specifications, models, and implementations of data abstractions
Partially Conservative Extensions of Arithmetic
Embedding and unsolvability theorems for modular lattices
Structured algebraic specifications: A kernel language
scientific article; zbMATH DE number 1053091 (Why is no real title available?)
On universal Horn classes categorical in some infinite power
Query evaluation in probabilistic relational databases
Extracting Herbrand disjunctions by functional interpretation
Hierarchical program specification and verification - a many-sorted logical approach
Glymour and Quine on theoretical equivalence
A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
Ambiguity in omega context free languages
Taking formalism seriously
Decidability in elementary analysis. I
Classifying circular cellular automata
A non-reified temporal logic
Controlled query evaluation with open queries for a decidable relational submodel
scientific article; zbMATH DE number 4156412 (Why is no real title available?)
Degrees of Undecidability in Term Rewriting
An infinite version of Arrow's theorem in the effective setting
Prefix and projection onto state in duration calculus
Terms in Cylindric Algebras
scientific article; zbMATH DE number 7680806 (Why is no real title available?)
Δ 2 0 -Mengen
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

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)