scientific article; zbMATH DE number 3073037
From MaRDI portal
Publication:5812175
zbMath0047.00703MaRDI QIDQ5812175
Publication date: 1952
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On hyperarithmetical realizability ⋮ Informational semantics, non-deterministic matrices and feasible deduction ⋮ On all strong Kleene generalizations of classical logic ⋮ Arithmetical realizability and basic logic ⋮ Nice embedding in classical logic ⋮ Correia semantics revisited ⋮ The Lambek calculus extended with intuitionistic propositional logic ⋮ Hypersequent rules with restricted contexts for propositional modal logics ⋮ Editors' introduction: The third life of quantum logic: Quantum logic inspired by quantum computing ⋮ On truth-gaps, bipolar belief and the assertability of vague propositions ⋮ The paraconsistent logic of quantum superpositions ⋮ Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic ⋮ What is the world of mathematics? ⋮ Propositional logic for topology-like matrices: A calculus with restricted substitution ⋮ Different senses of finitude: an inquiry into Hilbert's finitism ⋮ A short proof of Glivenko theorems for intermediate predicate logics ⋮ Does the deduction theorem fail for modal logic? ⋮ Three-valued logics in modal logic ⋮ The FE-closure operator in countable-valued logic ⋮ Semantics and proof-theory of depth bounded Boolean logics ⋮ Intuitionistic completeness of first-order logic ⋮ Abstract Hilbertian deductive systems, infon logic, and Datalog ⋮ A bipolar model of assertability and belief ⋮ On the proof-theory of two formalisations of modal first-order logic ⋮ Gradualness, uncertainty and bipolarity: making sense of fuzzy sets ⋮ Closed choice and a uniform low basis theorem ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Maximal and premaximal paraconsistency in the framework of three-valued semantics ⋮ Constructive semantics for instantaneous reactions ⋮ Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) ⋮ Sequential and distributed on-the-fly computation of weak tau-confluence ⋮ Recursive analysis of singular ordinary differential equations ⋮ A bipolar model of vague concepts based on random set and prototype theory ⋮ Some axioms for constructive analysis ⋮ Constructive Boolean circuits and the exactness of timed ternary simulation ⋮ Ideal paraconsistent logics ⋮ Relational semantics of the Lambek calculus extended with classical propositional logic ⋮ Editorial: Weighted logics for artificial intelligence -- an introductory discussion ⋮ Borderline vs. unknown: comparing three-valued representations of imperfect information ⋮ On truth-gaps, truth-gluts, and bipolar propositions ⋮ Characterizations of semicomputable sets of real numbers ⋮ A note on admissible rules and the disjunction property in intermediate logics ⋮ An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion ⋮ A constructive version of Tarski's geometry ⋮ On Beall's new interpretation of \(WK_{3}\) ⋮ Pragmatic interpretations of vague expressions: strongest meaning and nonmonotonic consequence ⋮ A map of dependencies among three-valued logics ⋮ Most general first order theorems are not recursively enumerable ⋮ Intensional aspects of function definitions ⋮ Partial functions and logics: A warning ⋮ Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves ⋮ Interpolants, cut elimination and flow graphs for the propositional calculus ⋮ Duality for semilattice representations ⋮ On a paradox of Hilbert and Bernays ⋮ Decision-theoretic three-way approximations of fuzzy sets ⋮ Relations in operational categories ⋮ A three-way approach for learning rules in automatic knowledge-based topic models ⋮ Conflicting accounts of \(\lambda\)-definability ⋮ Remark on Kreisel's conjecture ⋮ Skeptical reason maintenance and belief revision ⋮ Logical foundations for programming semantics ⋮ A logic for category theory ⋮ Power domains and second-order predicates ⋮ Acquiring search-control knowledge via static analysis ⋮ Notes on computable analysis ⋮ Functional interpretations of feasibly constructive arithmetic ⋮ A reasoning method for a paraconsistent logic ⋮ Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation ⋮ On list primitive recursion and the complexity of computing inf ⋮ Complexity of subclasses of the intuitionistic propositional calculus ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis ⋮ Adas and the equational theory of if-then-else ⋮ Theory of semi-instantiation in abstract argumentation ⋮ Recognition complexity of theories and their computational expressivity ⋮ On the simple substitution property for superintuitionistic and modal propositional logics ⋮ On the algorithmic complexity of static structures ⋮ On partial and paraconsistent logics ⋮ CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks ⋮ Fixing Zeno gaps ⋮ Continuity of operators on continuous and discrete time streams ⋮ First-order reasoning and primitive recursive natural number notations ⋮ A theorem on the consistency of circumscription ⋮ On the expressive power of schemes ⋮ Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets ⋮ Exception tracking in an open world ⋮ The \(\lambda \)-calculus and the unity of structural proof theory ⋮ The computational status of physics ⋮ A class of reversible primitive recursive functions ⋮ Real numbers, continued fractions and complexity classes ⋮ Data types over multiple-valued logics ⋮ Negation in rule-based database languages: A survey ⋮ Functorial polymorphism ⋮ On disjunctions and existential statements in intuitionistic systems of logic ⋮ Computable probability spaces ⋮ Notes on synonymy ⋮ An enumeration of the primitive recursive functions without repetition ⋮ On free modular lattices. II ⋮ Incomplete symbols -- definite descriptions revisited ⋮ A framework for compositional verification of multi-valued systems via abstraction-refinement
This page was built for publication:
