An "Absolute" Type of Logic
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2011
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913980857974784 |
|---|---|
| author | Avon, Mauro |
| author_facet | Avon, Mauro |
| contents | This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external structures, making the meaning of expressions depend solely on their constituent symbols. Terms and formulas are unified into a single notion of expression, with set-builder notation integrated as a primitive construct. Connectives and quantifiers are treated as operators among others rather than as privileged primitives. The deductive framework is minimal and intuitive, with soundness and consistency established and completeness examined. While computability requirements may limit universality, the system offers a unified and potentially more faithful model of human mathematical deduction, providing an alternative foundation for formal reasoning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1107_4696 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | An "Absolute" Type of Logic Avon, Mauro Logic This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external structures, making the meaning of expressions depend solely on their constituent symbols. Terms and formulas are unified into a single notion of expression, with set-builder notation integrated as a primitive construct. Connectives and quantifiers are treated as operators among others rather than as privileged primitives. The deductive framework is minimal and intuitive, with soundness and consistency established and completeness examined. While computability requirements may limit universality, the system offers a unified and potentially more faithful model of human mathematical deduction, providing an alternative foundation for formal reasoning. |
| title | An "Absolute" Type of Logic |
| topic | Logic |
| url | https://arxiv.org/abs/1107.4696 |