scientific article; zbMATH DE number 3550662

Publication date 1976

Decidability of theories and sets of sentences (03B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability (number-theoretic aspects) (11U05) Nonstandard analysis (26E35) Computability and recursion theory (03Dxx) General algebraic systems (08-XX) Order, lattices, ordered algebraic structures (06-XX)

Cited in

(only showing first 100 items - show all)

A logic-based approach to incremental reasoning on multi-agent systems
Probabilities defined on standard and non-standard cylindric set algebras
On the relationship between the complexity of decidability and decomposability of first-order theories
A list of arithmetical structures complete with respect to the first-order definability
scientific article; zbMATH DE number 3771857 (Why is no real title available?)
A unification algorithm for second-order monadic terms
Word problems in Elliott monoids
Models and theories I: The semantic view revisited
Structure of concurrency
Deontic action logic, atomic Boolean algebras and fault-tolerance
Expressive completeness of duration calculus.
Supercover semantics for deontic action logic
Non-standard stochastics with a first order algebraization
On decidability and axiomatizability of some ordered structures
Modality and axiomatic theories of truth. I: Friedman-Sheard
Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
On varieties of cylindric algebras with applications to logic
Interval logics with applications to study of tense and aspect in English
Freeness in classes without equality
Characterizing specification languages which admit initial semantics
A common generalization for MV-algebras and Łukasiewicz-Moisil algebras
Combining algebraizable logics
scientific article; zbMATH DE number 740351 (Why is no real title available?)
Intuitionistic ancestral logic as a dependently typed abstract programming language
Fuzzy sets and residuated logic
Equational theories of tropical semirings
Algorithmic uses of the Feferman-Vaught theorem
Modular specification of process algebras
On sets of relations definable by addition
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
Synonymous theories and knowledge representations in answer set programming
Sequential method in propositional dynamic logic
On undecidability of subset theories of some unars
On triangular norm-based propositional fuzzy logics
Logicism, interpretability, and knowledge of arithmetic
Information-based distance measures and the canonical reflection of view updates
Information-Optimal Reflections of View Updates on Relational Database Schemata
scientific article; zbMATH DE number 3909728 (Why is no real title available?)
Interpretation of AF C^*-algebras in Łukasiewicz sentential calculus
Some notes on truths and comprehension
Elementary descent recursion and proof theory
Recursive programs and denotational semantics in absolute logics of programs
Total correctness in nonstandard logics of programs
Natural limitations of decision procedures for arithmetic with bounded quantifiers
Decidability of general extensional mereology
Applying, extending, and specializing pseudorecursiveness
Are Points (Necessarily) Unextended?
A semantic approach to interpolation
A sequent calculus for relation algebras
Embeddings in groups of permutations with supports of bounded cardinality
Computable preference and utility
Some characterization theorems for infinitary universal Horn logic without equality
An essay in matrix semantics for consequence relations
Modulo-counting quantifiers over finite trees
First order data types and first order logic
On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
The scope of Gödel's first incompleteness theorem
Unification in Boolean rings
Tarski's definition and truth-makers
Higher-order logic and disquotational truth
A comparative study of open default theories
The compactness of first-order logic:from gödel to lindström
The semantics of second-order lambda calculus
Unique complements and decompositions of database schemata
Representable cylindric algebras
Theories with the independence property
Lattices of theories in languages without equality
Computation in networks of passively mobile finite-state sensors
Carnap's problem, definability and compositionality
Who's afraid of mathematical Platonism? -- An historical perspective
A generalization of the zero-one principle for sorting algorithms
Farey stellar subdivisions, ultrasimplicial groups, and \(K_ 0\) of AF \(C^*\)-algebras
Average case optimality for linear problems
A complete logic for reasoning about programs via nonstandard model theory. I
Undecidable theories of valuated abelian groups
scientific article; zbMATH DE number 7456057 (Why is no real title available?)
Duality Between Logics and Equivalence Relations
The complexity of completions in partial combinatory algebra
An isomorphism between monoids of external embeddings: About definability in arithmetic
On conservative extensions in logics with infinitary predicates
Theory evolution and reference kinematics
A Tableaux System for Deontic Action Logic
Boolean unification - the story so far
Interpretations of open default theories in non-monotonic logics
Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
On elementary equivalence for equality-free logic
A variety with locally solvable but globally unsolvable word problem
Definability of models by means of existential formulas without identity
A note on interpretations of many-sorted theories
Algorithms for sentences over integral domains
Varieties of complex algebras
Characterization of desirable properties of general database decompositions.
Universell axiomatisierbare Klassen von Fastkörpern. (Universally axiomatizable classes of near-fields)
Henkin's theorem in textbooks
Definability, decidability, complexity
Proving program inclusion using Hoare's logic
Programming and verifying a declarative first-order prover in Isabelle/HOL
Relational abstract interpretation of arrays in assembly code
Additive utility
How much propositional logic suffices for Rosser's essential undecidability theorem?

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 Q4124795)