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