Zobrazeno 1 - 6
of 6
pro vyhledávání: '"S. Mojtaba Mojtahedi"'
Publikováno v:
The Journal of Symbolic Logic. 84:1118-1135
For the Heyting Arithmetic HA, $HA^{\text{*}} $ is defined [14, 15] as the theory $\left\{ {A|HA \vdash A^\square } \right\}$, where $A^\square $ is called the box translation of A (Definition 2.4). We characterize the ${\text{\Sigma }}_1 $-provabili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4eab6a2db9e5e74da960464062743d1c
https://doi.org/10.1017/jsl.2019.44
https://doi.org/10.1017/jsl.2019.44
Publikováno v:
Annals of Pure and Applied Logic. 169:997-1043
In this paper we introduce a modal theory iH σ which is sound and complete for arithmetical Σ 1 -interpretations in HA , in other words, we will show that iH σ is the Σ 1 -provability logic of HA . Moreover we will show that iH σ is decidable. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ed136122453936f8875d1bf5f5f6e3d
https://doi.org/10.1016/j.apal.2018.05.001
https://doi.org/10.1016/j.apal.2018.05.001
Autor:
S. Mojtaba Mojtahedi
Publikováno v:
Logic Journal of the IGPL. 27:239-251
We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language, local (clas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8127188539fe56e451b52e9c6f17b5d3
https://doi.org/10.1093/jigpal/jzy036
https://doi.org/10.1093/jigpal/jzy036
Publikováno v:
Logic Journal of IGPL. 23:842-847
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b8c40a0390bcf3b1d373d0cf6e64780
https://doi.org/10.1093/jigpal/jzv031
https://doi.org/10.1093/jigpal/jzv031
Publikováno v:
Archive for Mathematical Logic. 53:881-895
We prove that Basic Arithmetic, BA, has the de Jongh property, i.e., for any propositional formula A(p 1,..., p n ) built up of atoms p 1,..., p n , BPC $${\vdash}$$ ? A(p 1,..., p n ) if and only if for all arithmetical sentences B 1,..., B n , BA $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::535684237d429f5ec7be2433500986ee
https://doi.org/10.1007/s00153-014-0394-7
https://doi.org/10.1007/s00153-014-0394-7
Publikováno v:
Mathematical Logic Quarterly. 60:6-11
Let denote a first-order logic in a language that contains infinitely many constant symbols and also containing intuitionistic logic . By , we mean the associated logic axiomatized by the double negation of the universal closure of the axioms of plus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb7e9c3711b2f755d8766c79cf0b0432
https://doi.org/10.1002/malq.201200083
https://doi.org/10.1002/malq.201200083