Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Bahareh Afshari"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 213, Iss Proc. CL&C 2016, Pp 1-10 (2016)
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite language of first
Externí odkaz:
https://doaj.org/article/7cb445ed63274353894f9a144bbd8981
Autor:
Bahareh Afshari, Dominik Wehr
Publikováno v:
Information and Computation, 290:104982. Elsevier
Beckmann [1] derives bounds on the length of reduction chains of classes of simply typed λ-calculus terms which are exact up-to a constant factor in their highest exponent. Afshari et al. [2] obtain similar bounds on acyclic higher-order recursion s
Publikováno v:
Logic Journal of the IGPL.
We introduce a path-based cyclic proof system for first-order $\mu $-calculus, the extension of first-order logic by second-order quantifiers for least and greatest fixed points of definable monotone functions. We prove soundness of the system and de
Autor:
Bahareh Afshari, Graham E. Leigh
Publikováno v:
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540340218
TAMC
TAMC
We extend Post’s programme to finite levels of the Ershov hierarchy of Δ2 sets, and characterise, in the spirit of Post [9], the degrees of the immune and hyperimmune d.c.e. sets. We also show that no properly d.c.e. set can be hh-immune, and indi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::677fa5fabe43095cf2aaea092608bc91
https://ora.ox.ac.uk/objects/uuid:d591ade8-5bf4-4f29-a4bb-8b1dfd8122f5
https://ora.ox.ac.uk/objects/uuid:d591ade8-5bf4-4f29-a4bb-8b1dfd8122f5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 213, Iss Proc. CL&C 2016, Pp 1-10 (2016)
CL&C
CL&C
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite language of first
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d35346f26c9d87bd6dfe7946432b225
Autor:
Bahareh Afshari, Michael Rathjen
Publikováno v:
Archive for Mathematical Logic. 49:275-281
The article shows a simple way of calibrating the strength of the theory of positive induction, $${{\rm ID}^{*}_{1}}$$ . Crucially the proof exploits the equivalence of $${\Sigma^{1}_{1}}$$ dependent choice and ω-model reflection for $${\Pi^{1}_{2}}
Autor:
Bahareh Afshari, Michael Rathjen
Publikováno v:
Annals of Pure and Applied Logic. 160:231-237
The larger project broached here is to look at the generally Π 2 1 sentence “if X is well-ordered then f ( X ) is well-ordered”, where f is a standard proof-theoretic function from ordinals to ordinals. It has turned out that a statement of this
Autor:
Bahareh Afshari, Graham E. Leigh
Publikováno v:
PAMM. 16:893-894