scientific article; zbMATH DE number 3550662

zbMath0354.02002MaRDI QIDQ4124795

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Related Items (only showing first 100 items - show all)

Modulo-counting quantifiers over finite trees ⋮ Equational theories of tropical semirings ⋮ Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus ⋮ On the Ehrenfeucht-Fraïssé game in theoretical computer science ⋮ Additive utility ⋮ Elementary descent recursion and proof theory ⋮ Computation in networks of passively mobile finite-state sensors ⋮ Decidability of general extensional mereology ⋮ Henkin’s Theorem in Textbooks ⋮ Deontic action logic, atomic Boolean algebras and fault-tolerance ⋮ On varieties of cylindric algebras with applications to logic ⋮ 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 ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ Probabilities of First-Order Sentences about Unary Functions ⋮ Varieties of complex algebras ⋮ Higher-order logic and disquotational truth ⋮ A unification algorithm for second-order monadic terms ⋮ A common generalization for MV-algebras and Łukasiewicz-Moisil algebras ⋮ Unification in Boolean rings ⋮ HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? ⋮ On triangular norm-based propositional fuzzy logics ⋮ Tarski's definition and truth-makers ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Applying, extending, and specializing pseudorecursiveness ⋮ Word problems in Elliott monoids ⋮ A variety with locally solvable but globally unsolvable word problem ⋮ Farey stellar subdivisions, ultrasimplicial groups, and \(K_ 0\) of AF \(C^*\)-algebras ⋮ LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC ⋮ MODALITY AND AXIOMATIC THEORIES OF TRUTH I: FRIEDMAN-SHEARD ⋮ A comprehensive picture of the decidability of mereological theories ⋮ Undecidable theories of valuated abelian groups ⋮ Knuth's iterated powers ⋮ First order data types and first order logic ⋮ Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language ⋮ Embeddings in groups of permutations with supports of bounded cardinality ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ Interval logics with applications to study of tense and aspect in English ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ Lattices of theories in languages without equality ⋮ A Tableaux System for Deontic Action Logic ⋮ A complete logic for reasoning about programs via nonstandard model theory. I ⋮ Universell axiomatisierbare Klassen von Fastkörpern. (Universally axiomatizable classes of near-fields) ⋮ Unnamed Item ⋮ Algorithms for sentences over integral domains ⋮ Computable preference and utility ⋮ Models and theories I: The semantic view revisited ⋮ Duality Between Logics and Equivalence Relations ⋮ Theory evolution and reference kinematics ⋮ Programming and verifying a declarative first-order prover in Isabelle/HOL ⋮ The Thomsen-Bachmann correspondence in metric geometry. I ⋮ Fuzzy sets and residuated logic ⋮ Probabilities defined on standard and non-standard cylindric set algebras ⋮ Unnamed Item ⋮ Structure of concurrency ⋮ Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics ⋮ Unnamed Item ⋮ The scope of Gödel's first incompleteness theorem ⋮ Freeness in classes without equality ⋮ Total correctness in nonstandard logics of programs ⋮ Some notes on truths and comprehension ⋮ Information-Optimal Reflections of View Updates on Relational Database Schemata ⋮ Theories with the independence property ⋮ Non-standard stochastics with a first order algebraization ⋮ Sequential method in propositional dynamic logic ⋮ A semantic approach to interpolation ⋮ Modular specification of process algebras ⋮ A generalization of the zero-one principle for sorting algorithms ⋮ The semantics of second-order lambda calculus ⋮ Combining algebraizable logics ⋮ Definability, decidability, complexity ⋮ On the relationship between the complexity of decidability and decomposability of first-order theories ⋮ The undecidability of the elementary theory of lattices of all equational theories of large signature ⋮ Effective Quantifier Elimination for Presburger Arithmetic with Infinity ⋮ Representable cylindric algebras ⋮ Unnamed Item ⋮ Boolean unification - the story so far ⋮ On decidability and axiomatizability of some ordered structures ⋮ On conservative extensions in logics with infinitary predicates ⋮ Supercover semantics for deontic action logic ⋮ On sets of relations definable by addition ⋮ A sequent calculus for relation algebras ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ Proving program inclusion using Hoare's logic ⋮ Characterizing specification languages which admit initial semantics ⋮ Some characterization theorems for infinitary universal Horn logic without equality ⋮ Hoare's logic for programming languages with two data types ⋮ Natural limitations of decision procedures for arithmetic with bounded quantifiers ⋮ Average case optimality for linear problems ⋮ Expressive completeness of duration calculus. ⋮ A comparative study of open default theories ⋮ Definability of models by means of existential formulas without identity ⋮ A simple type theory with partial functions and subtypes ⋮ The compactness of first-order logic:from gödel to lindström ⋮ A note on interpretations of many-sorted theories ⋮ Unique complements and decompositions of database schemata ⋮ Generalizing classical and effective model theory in theories of operations and classes ⋮ An isomorphism between monoids of external embeddings: About definability in arithmetic

This page was built for publication: