default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBahareh Afshari
Person information
- affiliation: University of Gothenburg, Sweden
- affiliation (former): University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Bahareh Afshari, Sebastian Enqvist, Graham E. Leigh:
Cyclic proofs for the first-order µ-calculus. Log. J. IGPL 32(1): 1-34 (2024)- [c14]Bahareh Afshari, Lide Grotenhuis, Graham E. Leigh, Lukas Zenger:
Intuitionistic Master Modality. AiML 2024: 19-40 - [i2]Bahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata:
Demystifying μ. CoRR abs/2401.01096 (2024) - [i1]Bahareh Afshari, Johannes Kloibhofer:
Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic. CoRR abs/2405.01935 (2024) - 2023
- [j6]Bahareh Afshari
, Dominik Wehr:
Exact bounds for acyclic higher-order recursion schemes. Inf. Comput. 290: 104982 (2023) - [j5]Bahareh Afshari:
Algebraic connectivity of the second power of a graph. J. Graph Theory 104(2): 275-281 (2023) - [c13]Bahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata:
A Cyclic Proof System for Full Computation Tree Logic. CSL 2023: 5:1-5:19 - [c12]Bahareh Afshari, Lide Grotenhuis, Graham E. Leigh, Lukas Zenger:
Ill-Founded Proof Systems for Intuitionistic Linear-Time Temporal Logic. TABLEAUX 2023: 223-241 - 2022
- [c11]Bahareh Afshari, Dominik Wehr:
Abstract Cyclic Proofs. WoLLIC 2022: 309-325 - 2021
- [c10]Bahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata:
Uniform Interpolation from Cyclic Proofs: The Case of Modal Mu-Calculus. TABLEAUX 2021: 335-353 - 2020
- [j4]Bahareh Afshari, Stefan Hetzl, Graham E. Leigh:
Herbrand's theorem as higher order recursion. Ann. Pure Appl. Log. 171(6): 102792 (2020) - [c9]Bahareh Afshari:
Cyclic Proof Systems for Modal Logics. AiML 2020: 3
2010 – 2019
- 2019
- [c8]Bahareh Afshari, Graham E. Leigh:
Lyndon Interpolation for Modal μ-Calculus. TbiLLC 2019: 197-213 - [c7]Bahareh Afshari, Gerhard Jäger, Graham E. Leigh:
An Infinitary Treatment of Full Mu-Calculus. WoLLIC 2019: 17-34 - 2017
- [c6]Bahareh Afshari, Graham E. Leigh:
Cut-free completeness for modal mu-calculus. LICS 2017: 1-12 - 2016
- [c5]Bahareh Afshari, Stefan Hetzl, Graham E. Leigh:
On the Herbrand content of LK. CL&C 2016: 1-10 - 2015
- [c4]Bahareh Afshari, Stefan Hetzl, Graham Emil Leigh:
Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars. TLCA 2015: 1-16 - 2013
- [c3]Bahareh Afshari, Graham E. Leigh:
On closure ordinals for the modal mu-calculus. CSL 2013: 30-44 - 2012
- [c2]Bahareh Afshari, Michael Rathjen:
Ordinal Analysis and the Infinite Ramsey Theorem. CiE 2012: 1-10 - 2010
- [j3]Bahareh Afshari, Michael Rathjen:
A note on the theory of positive induction, ID*1. Arch. Math. Log. 49(2): 275-281 (2010)
2000 – 2009
- 2009
- [j2]Bahareh Afshari, Michael Rathjen:
Reverse mathematics and well-ordering principles: A pilot study. Ann. Pure Appl. Log. 160(3): 231-237 (2009) - 2007
- [j1]Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan:
Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007) - 2006
- [c1]Bahareh Afshari, George Barmpalias, S. Barry Cooper:
Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703
Coauthor Index
aka: Graham E. Leigh
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
