Executability and connexivity in an interpretation of Griss
From MaRDI portal
Publication:6127196
Recommendations
Cites work
- A Gödel-Artemov-style analysis of constructible falsity
- A modification of Parry's analytic implication
- A semantical study of constructible falsity
- A semantical theory of analytic implication
- An embedding-based completeness proof for Nelson's paraconsistent logic
- An introduction to non-classical logic. From if to is
- Analytic implication
- Arithmetic formulated relevantly
- Constructible falsity
- Constructible falsity and inexact predicates
- Constructions and negationless logic
- Constructive negation, implication, and co-implication
- Constructive negations and paraconsistency
- Explicit analyses of proof/refutation interaction for constructible falsity and Heyting–Brouwer logic
- scientific article; zbMATH DE number 3139759 (Why is no real title available?)
- scientific article; zbMATH DE number 1749203 (Why is no real title available?)
- scientific article; zbMATH DE number 3009953 (Why is no real title available?)
- scientific article; zbMATH DE number 3059607 (Why is no real title available?)
- scientific article; zbMATH DE number 3066805 (Why is no real title available?)
- scientific article; zbMATH DE number 3085190 (Why is no real title available?)
- Inconsistent models (and infinite models) for arithmetics with constructible falsity
- Intuitionistic logic with strong negation
- Logic of proofs
- Logics and falsifications. A new perspective on constructivist semantics
- Logics of nonsense and Parry systems
- Modal Meinongianism: conceiving the impossible
- Negation as cancellation, and connexive logic
- Proofs, disproofs, and their duals
- The theory of topic-sensitive intentional modals
Cited in
(5)- Connexive logic: new old challenges
- Two decades of non-classical mathematics: introduction to the special issue
- Possibilist models of executable arithmetic in an interpretation of Griss
- Contradictions without negation and a proof-theoretic, bilateralist account of connexive logics
- Generalized Epstein semantics for Parry systems
This page was built for publication: Executability and connexivity in an interpretation of Griss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6127196)