Extending computational trinitarianism
From MaRDI portal
Cites work
- A formulation of the simple theory of types
- About opposition and duality in paraconsistent type theory
- An internal language for autonomous categories
- An unsolvable problem of elementary number theory.
- Automating and computing paraconsistent reasoning: contraction-free, resolution and type systems
- Changing the logic without changing the subject: the case of computability
- Coherence for compact closed categories
- Coherence in closed categories
- Coherence in substructural categories
- Combinatory logic. With two sections by William Craig.
- Complement-topoi and dual intuitionistic logic
- Computational adequacy for substructural lambda calculi
- Computational interpretations of linear logic
- Constructible falsity
- Constructible falsity and inexact predicates
- Curry-Howard-Lambek correspondence for intuitionistic belief
- Extending the Curry-Howard interpretation to linear, relevant and other resource logics
- Falsification, natural deduction and bi-intuitionistic logic
- From (paraconsistent) topos logic to universal (topos) logic
- scientific article; zbMATH DE number 5318491 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 53544 (Why is no real title available?)
- scientific article; zbMATH DE number 193320 (Why is no real title available?)
- scientific article; zbMATH DE number 3504935 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 700092 (Why is no real title available?)
- scientific article; zbMATH DE number 1392281 (Why is no real title available?)
- scientific article; zbMATH DE number 3305156 (Why is no real title available?)
- scientific article; zbMATH DE number 3385867 (Why is no real title available?)
- scientific article; zbMATH DE number 3412605 (Why is no real title available?)
- Implementing the `Fool's model' of combinatory logic
- Linear logic
- Logics without the contraction rule
- Modal Homotopy Type Theory
- Natural deduction systems for Nelson's paraconsistent logic and its neighbors
- New axiomatics for relevant logics. I
- Paraconsistency in categories: case of relevance logic
- Paradoxes and Inconsistent Mathematics
- Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
- Physics, Topology, Logic and Computation: A Rosetta Stone
- Proof-theoretical coherence
- Residuated lattices. An algebraic glimpse at substructural logics
- S (for syllogism) revisited. ``The revolution devours its children
- Strong normalizability of typed lambda-calculi for substructural logics
- The evil twin: the basics of complement-toposes
- The logic of paradox
- The Mathematics of Sentence Structure
- Theoretical Computer Science
- Type theory with opposite types: a paraconsistent type theory
This page was built for publication: Extending computational trinitarianism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304899)