scientific article; zbMATH DE number 1257634

Publication date: 2 March 1999

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

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Classical propositional logic (03B05) Computability and recursion theory (03Dxx) Model theory (03Cxx) Set theory (03Exx) Nonstandard models (03Hxx)

Related Items

Operational concepts of nonmonotonic logics. I: Default logic, A Logical Approach to Data-Aware Automated Sequence Generation, Correspondence analysis for some fragments of classical propositional logic, Generality's price: Inescapable deficiencies in machine-learned programs, Generalized correspondence analysis for three-valued logics, Revisiting da Costa logic, Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology, Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors, SIMILARITY LOGIC AND TRANSLATIONS, On confluence and residuals in Cauchy convergent transfinite rewriting, Default theories over monadic languages, Infinitary self-reference in learning theory, The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf, Conditionals in theories of truth, Same same but different: an alphabetically innocent compositional predicate logic, Passive induction and a solution to a Paris-Wilkie open question, Automated compositional proofs for real-time systems, Remarks on the theory of quasi-sets, A full computation-relevant topological dynamics classification of elementary cellular automata, Symmetries of knowledge bases, Faithfully quadratic rings, Some problems concerning language and physics, Can Identity Be Relativized?, Mathematical elements of elementary education, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Generic complexity of undecidable problems, The subset relation and 2‐stratified sentences in set theory and class theory, Local confluence of conditional and generalized term rewriting systems, A relational perspective of attribute reduction in rough set-based data analysis, König's Infinity Lemma and Beth's Tree Theorem, Decision theory with prospect interference and entanglement, The quasi-lattice of indiscernible elements, On one of Specker's theorems, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Relational semantics of the Lambek calculus extended with classical propositional logic, Satisfiability in composition-nominative logics, Closure-based constraints in formal concept analysis, Practical algorithms for MSO model-checking on tree-decomposable graphs, \(\epsilon\)-semantics computations on biological systems, Sets and functions in theoretical physics, Classical negation and expansions of Belnap-Dunn logic, Generalizing functional completeness in Belnap-Dunn logic, Predicate Pairing for program verification, Wave-particle duality and the objectiveness of ``true and ``false, Use of logical models for proving infeasibility in term rewriting, On existence in set theory, A diagrammatic calculus of syllogisms, On Vidal's trivalent explanations for defective conditional in mathematics, A list of arithmetical structures complete with respect to the first-order definability, Proofs of the Compactness Theorem, A generalization of the second incompleteness theorem and some exceptions to it, Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects, Natural deduction for three-valued regular logics, A thread calculus with molecular dynamics, MATHEMATICAL STRUCTURE OF QUANTUM DECISION THEORY, Inclusion dynamics hybrid automata, Characterizing programming systems allowing program self-reference, Proving semantic properties as first-order satisfiability, Scaled aggregation operations over two- and three-dimensional index matrices, Satisfaction and Friendliness Relations within Classical Logic: Proof-Theoretic Approach, Problems in epistemic space, Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem, SMALL INFINITARY EPISTEMIC LOGICS, Using well-founded relations for proving operational termination, Full operational set theory with unbounded existential quantification and power set, Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning, Finite axiomatizability of local set theory, Unnamed Item, How to build a hypercomputer, Recognizing the Farey-Stern-Brocot AF algebra, Quasigraphs and skeletal partitions, A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics, Probability and logic in belief systems, Formalizing Scientifically Applicable Mathematics in a Definitional Framework, A NEGLECTED RESOLUTION OF RUSSELL’S PARADOX OF PROPOSITIONS, Algebraic approach to algorithmic logic, Reverse mathematics and its meaning, The compactness of first-order logic:from gödel to lindström, Labels for non-individuals?, TRACTARIAN LOGICISM: OPERATIONS, NUMBERS, INDUCTION, An interpretation of Łukasiewicz's 4-valued modal logic