scientific article; zbMATH DE number 3550662

zbMATH Open0354.02002MaRDI QIDQ4124795FDOQ4124795

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)

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

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)