No label defined (Q3347874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3891353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3891353 |
Statements
1985
0 references
deductive system
0 references
epistemic logic
0 references
higher-order variables and quantifiers
0 references
formalization of intensional concepts
0 references
0.92864656
0 references
0.92767686
0 references
0.91526175
0 references
0.91006327
0 references
0.90813327
0 references
0 references
0.90646225
0 references
[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.
0 references