Many-valued logic of informal provability: a non-deterministic strategy
From MaRDI portal
Publication:4577994
Recommendations
Cites work
- A problem with the dependence of informal proofs on formal proofs
- Finite non-deterministic semantics for some modal systems
- scientific article; zbMATH DE number 3891353 (Why is no real title available?)
- scientific article; zbMATH DE number 43479 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 2213620 (Why is no real title available?)
- In defense of epistemic arithmetic
- Informal proofs and mathematical rigour
- Outline of a Theory of Truth
- Reflecting in epistemic arithmetic
Cited in
(11)- Non-deterministic logic of informal provability has no finite characterization
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics
- Tree-like proof systems for finitely-many valued non-deterministic consequence relations
- Proof systems for BAT consequence relations
- Logic of informal provability with truth values
- Informal provability, first-order BAT logic and first steps towards a formal theory of informal provability
- Rigor and formalization
- A Gödel-Dugundji-style theorem for the minimal structural logic
- Two decades of non-classical mathematics: introduction to the special issue
- Nondeterministic first-order T-BAT logic
- Boolean and modal connectives as primitives in non-deterministic semantics
This page was built for publication: Many-valued logic of informal provability: a non-deterministic strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577994)