The following pages link to (Q3997000):
Displayed 21 items.
- Boolean logics with relations (Q604451) (← links)
- Comparing Hagino's categorical programming language and typed lambda- calculi (Q685425) (← links)
- Multi-valued logic and Gröbner bases with applications to modal logic (Q804567) (← links)
- Prolegomena to a theory of mechanized formal reasoning (Q1140436) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- Rosy with sider? The case of the metaphysical liar (Q1633210) (← links)
- Equational closure and closure with respect to enumeration on a set of partial multivalued logic functions (Q2287402) (← links)
- Formalizing abstract computability: Turing categories in Coq (Q2333325) (← links)
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← links)
- An infinity of super-Belnap logics (Q4583174) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- In Defence of Dialetheism: A Reply to Beziau and Tkaczyk (Q4683225) (← links)
- A Logic for Ambiguous Description (Q4916207) (← links)
- Cycling in proofs and feasibility (Q4942870) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- An equivalence preserving first order unfold/fold transformation system (Q5096195) (← links)
- An Epistemic Interpretation of Paraconsistent Weak Kleene Logic (Q5215506) (← links)
- PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS (Q5216971) (← links)
- Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix II. Only one designated value (Q5231281) (← links)
- Three-Valued Paraconsistent Propositional Logics (Q5241519) (← links)
- Defining totality in the enumeration degrees (Q5741445) (← links)