scientific article; zbMATH DE number 4114587
From MaRDI portal
Publication:4729754
zbMath0681.03001MaRDI QIDQ4729754
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Dynamic Reasoning Systems, Why mathematics needs engineering, Issues in commonsense set theory, Proof systems for structured algebraic specifications: An overview, A program logic for fresh name generation, Languages with self-reference. II: Knowledge, belief, and modality, The elimination of \textit{de re} formulas, Effective computation of immersion obstructions for unions of graph classes, An Arithmetically Complete Predicate Modal Logic, On the proof-theory of two formalisations of modal first-order logic, From Inconsistency to Incompatibility, Keeping logic in the trivium of computer science: a teaching perspective, \textsf{LOGIC}: a Coq library for logics, A Variant of Material Connexive Logic, Revisiting \(\mathbb Z\), Unnamed Item, Undecidability and incompleteness in classical mechanics, Sets and plural comprehension, Weakening and extending \(\mathbb{Z}\), The quantifier structure of sentences that characterize nondeterministic time complexity, Pair-Dense Relation Algebras, Fuzzy logic programming reduced to reasoning with attribute implications, Nonmonotonicity in the framework of parametric logic, Semantic paradoxes as equations., Defining the meaning of tabular mathematical expressions, Minimal bases of temporal attribute implications, Relational division in rank-aware databases, A single proof of classical behaviour in da Costa's \(C_n\) systems, Extensions for open default theories via the domain closure assumption, An Application of Paraconsistent Logic to Physics: Complementarity, A fuzzy logic with interval truth values, Game logic and its applications. I, SOME MODEL-THEORETIC RESULTS ON THE 3-VALUED PARACONSISTENT FIRST-ORDER LOGIC QCIORE, Turning decision procedures into disprovers, A comparative study of open default theories, On S, A functional logic for higher level reasoning about computation, The completeness of functional logic, Monoidal functional dependencies
