scientific article; zbMATH DE number 3550662

Publication date 1976

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

Cited in

(only showing first 100 items - show all)

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

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)