Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Zofia Adamowicz"'
Autor:
Zofia Adamowicz
Publikováno v:
Fundamenta Mathematicae. 242:75-92
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f299881cc66bbaaf509b0d797a95c1d
https://doi.org/10.4064/fm323-10-2017
https://doi.org/10.4064/fm323-10-2017
This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. This definition is optimal with respect to quantifier complexity and allows us to improve some previously known results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b81d132706ae886a8d10100f16205712
https://doi.org/10.1017/jsl.2015.36
https://doi.org/10.1017/jsl.2015.36
Publikováno v:
The Journal of Symbolic Logic. 77:649-655
We prove that: • if there is a model of IΔ0 + ¬exp with cofinal Σ1-definable elements and a Σ1 truth definition for Σ1 sentences, then IΔ0 + ¬exp + ¬BΣ1 is consistent,• there is a model of IΔ0 + Ω1 + ¬exp with cofinal Σ1-definable el
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7c59bdab4402ae3129a3d4d11adc2db
https://doi.org/10.2178/jsl/1333566643
https://doi.org/10.2178/jsl/1333566643
Autor:
Konrad Zdanowski, Zofia Adamowicz
Publikováno v:
Fundamenta Mathematicae. 212:191-216
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9517e92f0a461ee5f1e8aaabfa4c7318
https://doi.org/10.4064/fm212-3-1
https://doi.org/10.4064/fm212-3-1
Publikováno v:
MLQ. 56:126-130
We show that for each n ≥ 1, if T2n does not prove the weak pigeonhole principle for Σbn functions, then the collection scheme B Σ1 is not finitely axiomatizable over T2n. The same result holds with Sn2 in place of T 2n (© 2010 WILEY-VCH Verlag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6713642cad5a48116d26ab0b93749a45
https://doi.org/10.1002/malq.200810043
https://doi.org/10.1002/malq.200810043
Publikováno v:
Annals of Pure and Applied Logic. 145:91-95
For any n , we construct a model of T 2 n + ¬ exp in which each ∃ s Π n + 1 b formula is equivalent to an ∃ Π n b formula.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd56fe221ba1ca1de078f392acda0241
https://doi.org/10.1016/j.apal.2006.06.002
https://doi.org/10.1016/j.apal.2006.06.002
Publikováno v:
Theoretical Computer Science. 322:5-16
We introduce some Π1-expressible combinatorial principles which may be treated as axioms for some bounded arithmetic theories. The principles, denoted Sk(Σ n b ,length log k ) and Sk(Σ n b ,depth log k ) (where ‘Sk’ stands for ‘Skolem’), a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::338d5bb34c0ee9aac86054b35b775f38
https://doi.org/10.1016/j.tcs.2004.03.022
https://doi.org/10.1016/j.tcs.2004.03.022
Publikováno v:
Fundamenta Mathematicae. 180:139-159
We define a recursive theory which axomatizes a class of models of I∆0+Ω3+¬exp all of which share two features: firstly, the set of ∆0 definable elements of the model is majorized by the set of elements definable by ∆0 formulae of fixed compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da39d1d8bbf18c8e878401e8451e70ec
https://doi.org/10.4064/fm180-2-2
https://doi.org/10.4064/fm180-2-2
Autor:
Zofia Adamowicz
Publikováno v:
Fundamenta Mathematicae. 171:279-292
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b3e73419a5072fde0e33a1d0ab98d50
https://doi.org/10.4064/fm171-3-7
https://doi.org/10.4064/fm171-3-7