scientific article; zbMATH DE number 3891353
deductive systemepistemic logicformalization of intensional conceptshigher-order variables and quantifiers
Philosophical and critical aspects of logic and foundations (03A05) Classical first-order logic (03B10) Foundations of classical theories (including reverse mathematics) (03B30) Other nonclassical logic (03B60) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35)
[For the entire collection see Zbl 0547.00010.] In this paper, a language and deductive system of epistemic logic for arithmetic are developed. In addition to the usual connectives and quantifiers, the language contains an epistemic operator K. If A is a well-formed formula, then K(A) is well-formed. Although an interpretation of K as deducibility in a particular deductive system is used for certain purposes, it is shown that there are serious philosophical (and technical) limitations to it. The preferred reading of K(A) is A is ideally, or potentially, knowable. Even though the underlying logic of the system is classical, it is shown that the language of intuitionistic arithmetic can be translated into it. Thus, the present system is capable of expressing formulas of both classical and intuitionistic arithmetic, as well as formulas of mixed constructivity. Disjunction and existence theorems are obtained: If A and B are sentences and \(\vdash K(A)\vee K(B)\), then either \(\vdash A\) or \(\vdash B\), and if C(x) has only x free, and \(\vdash \exists xC(x)\), then there is a numeral \(\bar n\) such that \(\vdash C(\bar n)\). It is proposed that the present system can contribute to an understanding of the differences between classical and constructive arithmetic, and, moreover, that it can illuminate the epistemic aspects of normal (classical) mathematical practice. In later sections, the language and deductive system are extended to include higher-order variables and quantifiers. Among the features of the expanded systems not shared by the first-order versions are technical counterparts of some well-known philosophical problems involving intensional concepts. Finally, applications of the language to the formalization of intensional concepts in (informal) mathematics are presented.
- Epistemic arithmetic is a conservative extension of intuitionistic arithmetic
- An arithmetical interpretation of verification and intuitionistic knowledge
- scientific article; zbMATH DE number 3957097
- An empirically feasible approach to the epistemology of arithmetic
- scientific article; zbMATH DE number 1199707
- Epistemic predicates in the arithmetical context
- Intuitionistic logic as epistemic logic
- INTUITIONISTIC EPISTEMIC LOGIC
- scientific article; zbMATH DE number 51606
- Logicism, interpretability, and knowledge of arithmetic
- Epistemic theories and the interpretation of Gödel's incompleteness theorems
- In defense of epistemic arithmetic
- Provability in principle and controversial constructivistic principles
- Epistemic independence in numerical possibility theory.
- Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
- Mechanism, truth, and Penrose's new argument
- Non-deterministic logic of informal provability has no finite characterization
- Short-circuiting the definition of mathematical knowledge for an artificial general intelligence
- Fast-collapsing theories
- Modal-epistemic arithmetic and the problem of quantifying in
- Montague's paradox, informal provability, and explicit modal logic
- Closure of a priori knowability under a priori knowable material implication
- scientific article; zbMATH DE number 3891352 (Why is no real title available?)
- Epistemic arithmetic is a conservative extension of intuitionistic arithmetic
- Two Proof-Theoretic Remarks on EA + ECT
- A machine that knows its own code
- Many-valued logic of informal provability: a non-deterministic strategy
- An arithmetic interpretation of intuitionistic verification
- Epistemic predicates in the arithmetical context
- Proof-theoretic semantics and feasibility
- Assertions, Hypotheses, Conjectures, Expectations: Rough-Sets Semantics and Proof Theory
- Knowledge of Arithmetic
- Integrating classical and intuitionistic type theory
- Epistemic and intuitionistic formal systems
- A CLASSICAL MODAL THEORY OF LAWLESS SEQUENCES
- DISJUNCTION AND EXISTENCE PROPERTIES IN MODAL ARITHMETIC
- Structuralism and informal provability
- Epistemic entrenchment and arithmetical hierarchy
- What is intuitionistic arithmetic?
- Nondeterministic first-order T-BAT logic
- Topological models of epistemic set theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347874)