• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 5
Sort:
by name
by year
Article
Kolmakov E., Beklemishev L. D. Journal of Symbolic Logic. 2019. Vol. Volume 84. No. Issue 2. P. 849-869.

A formula φ is called n-provable in a formal arithmetical theory S if φ is provable in S together with all true arithmetical Πn-sentences taken as additional axioms. While in general the set of all n-provable formulas, for a fixed n>0 , is not recursively enumerable, the set of formulas φ whose n-provability is provable in a given r.e. metatheory T is r.e. This set is deductively closed and will be, in general, an extension of S. We prove that these theories can be naturally axiomatized in terms of progressions of iterated local reflection principles. In particular, the set of provably 1-provable sentences of Peano arithmetic PA can be axiomatized by εo times iterated local reflection schema over PA . Our characterizations yield additional information on the proof-theoretic strength of these theories (w.r.t. various measures of it) and on their axiomatizability. We also study the question of speed-up of proofs and show that in some cases a proof of n-provability of a sentence can be much shorter than its proof from iterated reflection principles.

Added: Jun 24, 2019
Article
Bauwens B. F., Shen A. Journal of Symbolic Logic. 2013. Vol. 79. No. 2. P. 620-632.
Added: Oct 2, 2015
Article
Ianovski E., Miller R. G., Ng K. M. et al. Journal of Symbolic Logic. 2014. Vol. 3. No. 79. P. 859-881.

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations R, S, a componentwise reducibility is defined by

R ≤ S ⇔ ∃f ∀x, y [x R y ↔ f (x) S f (y)].

Here, f is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and f must be computable. We show that there is a  -complete equivalence relation, but no  -complete for k ≥ 2. We show that  preorders arising naturally in the above-mentioned areas are  -complete. This includes polynomial time m-reducibility on exponential time sets, which is  , almost inclusion on r.e. sets, which is  , and Turing reducibility on r.e. sets, which is  .

Added: Feb 25, 2019
Article
Sustretov D. Journal of Symbolic Logic. 2016. Vol. 81. No. 3. P. 917-935.

The objective of this article is to characterise elimination of finite generalised imaginaries (as defined by Hrushovski) in terms of group cohomology. As an application, I consider series of Zariski geometries constructed by Hrushovski and Zilber, and indicate how their non-definability in algebraically closed fields and other theories is connected to eliminability of certain generalised imaginaries.

Added: Oct 18, 2018
Article
Gabbay D., Shehtman V. B. Journal of Symbolic Logic. 1993. Vol. 58. No. 3. P. 800-823.
Added: Oct 8, 2010