On Consistency and Decidability in Some Paraconsistent Arithmetics

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985955%3A_____%2F21%3A00546146" target="_blank" >RIV/67985955:_____/21:00546146 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.26686/ajl.v18i5.6921" target="_blank" >https://doi.org/10.26686/ajl.v18i5.6921</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.26686/ajl.v18i5.6921" target="_blank" >10.26686/ajl.v18i5.6921</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Consistency and Decidability in Some Paraconsistent Arithmetics

Popis výsledku v původním jazyce

The standard style of argument used to prove that a theory is undecidable relies on certain consistency assumptions, usually that some fragment or other is negation consistent. In a non-paraconsistent setting, this amounts to an assumption that the theory is non-trivial, but these diverge when theories are couched in paraconsistent logics. Furthermore, there are general methods for constructing inconsistent models of arithmetic from consistent models, and the theories of such inconsistent models seem likely to differ in terms of complexity. In this paper, I begin to explore this terrain, working, particularly, in inconsistent theories of arithmetic couched in three-valued paraconsistent logics which have strong (i.e. detaching) conditionals.

Název v anglickém jazyce

On Consistency and Decidability in Some Paraconsistent Arithmetics

Popis výsledku anglicky

The standard style of argument used to prove that a theory is undecidable relies on certain consistency assumptions, usually that some fragment or other is negation consistent. In a non-paraconsistent setting, this amounts to an assumption that the theory is non-trivial, but these diverge when theories are couched in paraconsistent logics. Furthermore, there are general methods for constructing inconsistent models of arithmetic from consistent models, and the theories of such inconsistent models seem likely to differ in terms of complexity. In this paper, I begin to explore this terrain, working, particularly, in inconsistent theories of arithmetic couched in three-valued paraconsistent logics which have strong (i.e. detaching) conditionals.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

60301 - Philosophy, History and Philosophy of science and technology

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Australasian Journal of Logic

ISSN

1448-5052

e-ISSN

1448-5052

Svazek periodika

18

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

AU - Austrálie

Počet stran výsledku

30

Strana od-do

473-502

Kód UT WoS článku

000723228000001

EID výsledku v databázi Scopus

—