The following pages link to (Q5812175):
Displaying 50 items.
- Propositional logic for topology-like matrices: A calculus with restricted substitution (Q599051) (← links)
- A bipolar model of assertability and belief (Q622286) (← links)
- On the proof-theory of two formalisations of modal first-order logic (Q622627) (← links)
- Maximal and premaximal paraconsistency in the framework of three-valued semantics (Q631512) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Recursive analysis of singular ordinary differential equations (Q638473) (← links)
- Ideal paraconsistent logics (Q647409) (← links)
- A note on admissible rules and the disjunction property in intermediate logics (Q661289) (← links)
- An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion (Q662344) (← links)
- On Beall's new interpretation of \(WK_{3}\) (Q667921) (← links)
- Most general first order theorems are not recursively enumerable (Q672461) (← links)
- Intensional aspects of function definitions (Q673180) (← links)
- Partial functions and logics: A warning (Q673461) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
- Duality for semilattice representations (Q675139) (← links)
- On a paradox of Hilbert and Bernays (Q676182) (← links)
- Relations in operational categories (Q678847) (← links)
- Remark on Kreisel's conjecture (Q684960) (← links)
- Skeptical reason maintenance and belief revision (Q685347) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- A logic for category theory (Q685421) (← links)
- Power domains and second-order predicates (Q685429) (← links)
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- A reasoning method for a paraconsistent logic (Q687160) (← links)
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- On list primitive recursion and the complexity of computing inf (Q688724) (← links)
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete (Q689290) (← links)
- Adas and the equational theory of if-then-else (Q690107) (← links)
- Recognition complexity of theories and their computational expressivity (Q694245) (← links)
- On partial and paraconsistent logics (Q701297) (← links)
- First-order reasoning and primitive recursive natural number notations (Q708925) (← links)
- On the expressive power of schemes (Q719245) (← links)
- Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets (Q722147) (← links)
- Exception tracking in an open world (Q724930) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- The computational status of physics (Q734210) (← links)
- A class of reversible primitive recursive functions (Q737109) (← links)
- Real numbers, continued fractions and complexity classes (Q751655) (← links)
- Data types over multiple-valued logics (Q752687) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Functorial polymorphism (Q753948) (← links)
- On disjunctions and existential statements in intuitionistic systems of logic (Q767454) (← links)
- Computable probability spaces (Q771906) (← links)
- Notes on synonymy (Q774156) (← links)
- An enumeration of the primitive recursive functions without repetition (Q775448) (← links)
- On free modular lattices. II (Q775840) (← links)
