Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiron Cohen 0001
Person information
- affiliation: Ben-Gurion University of the Negev, Beer-Sheva, Israel
- affiliation (2016 - 2018): Cornell University, Ithaca, NY, USA
- affiliation (PhD 2016): Tel Aviv University, Israel
Other persons with the same name
- Liron Cohen 0002 — University of Southern California, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Liron Cohen
, Adham Jabarin, Andrei Popescu, Reuben N. S. Rowe:
The Complex(ity) Landscape of Checking Infinite Descent. Proc. ACM Program. Lang. 8(POPL): 1352-1384 (2024)- 2023
- [c18]Liron Cohen, Vincent Rahli:
Realizing Continuity Using Stateful Computations. CSL 2023: 15:1-15:18 - [c17]Liron Cohen, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun:
Inductive Continuity via Brouwer Trees. MFCS 2023: 37:1-37:16 - [i5]Gabriella Chouraqui, Liron Cohen, Gil Einziger, Liel Leman:
Uncertainty Estimation based on Geometric Separation. CoRR abs/2301.04452 (2023) - [i4]Liron Cohen, Vincent Rahli:
TT☐C: a Family of Extensional Type Theories with Effectful Realizers of Continuity. CoRR abs/2307.14168 (2023) - 2022
- [c16]Liron Cohen, Vincent Rahli:
Constructing Unprejudiced Extensional Type Theories with Choices via Modalities. FSCD 2022: 10:1-10:23 - [c15]Gabriella Chouraqui, Liron Cohen, Gil Einziger, Liel Leman:
A geometric method for improved uncertainty estimation in real-time. UAI 2022: 422-432 - [i3]Gabriella Chouraqui, Liron Cohen, Gil Einziger, Liel Leman:
A Geometric Method for Improved Uncertainty Estimation in Real-time. CoRR abs/2206.11562 (2022) - 2021
- [c14]Liron Cohen:
Non-well-founded Deduction for Induction and Coinduction. CADE 2021: 3-24 - [c13]Liron Cohen:
Formally Computing with the Non-computable. CiE 2021: 135-145 - [c12]Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli:
Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle. CSL 2021: 11:1-11:23 - [c11]Liron Cohen, Étienne Miquey, Ross Tate:
Evidenced Frames: A Unifying Framework Broadening Realizability Models. LICS 2021: 1-13 - [e1]Liron Cohen, Cezary Kaliszyk:
12th International Conference on Interactive Theorem Proving, ITP 2021, June 29 to July 1, 2021, Rome, Italy (Virtual Conference). LIPIcs 193, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-188-7 [contents] - 2020
- [j7]Liron Cohen, Reuben N. S. Rowe:
Non-well-founded Proof Theory of Transitive Closure Logic. ACM Trans. Comput. Log. 21(4): 31:1-31:31 (2020) - [c10]Liron Cohen, Reuben N. S. Rowe:
Integrating Induction and Coinduction via Closure Operators and Proof Cycles. IJCAR (1) 2020: 375-394
2010 – 2019
- 2019
- [j6]Vincent Rahli, Mark Bickford, Liron Cohen, Robert L. Constable:
Bar Induction is Compatible with Constructive Type Theory. J. ACM 66(2): 13:1-13:35 (2019) - [j5]Liron Cohen, Robert L. Constable:
Intuitionistic ancestral logic. J. Log. Comput. 29(4): 469-486 (2019) - [j4]Liron Cohen, Reuben N. S. Rowe, Yoni Zohar:
Towards automated reasoning in Herbrand structures. J. Log. Comput. 29(5): 693-721 (2019) - [j3]Liron Cohen, Arnon Avron:
The middle ground-ancestral logic. Synth. 196(7): 2671-2693 (2019) - [c9]Liron Cohen, Sofia Abreu Faro, Ross Tate:
The Effects of Effects on Constructivism. MFPS 2019: 87-120 - 2018
- [j2]Arnon Avron, Liron Cohen:
Applicable Mathematics in a Minimal Computational Theory of Sets. Log. Methods Comput. Sci. 14(4) (2018) - [c8]Liron Cohen, Reuben N. S. Rowe:
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. CSL 2018: 17:1-17:16 - [c7]Arnon Avron, Liron Cohen:
A Minimal Computational Theory of a Minimal Computational Universe. LFCS 2018: 37-54 - [c6]Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli:
Computability Beyond Church-Turing via Choice Sequences. LICS 2018: 245-254 - [c5]Vincent Rahli, Liron Cohen, Mark Bickford:
A Verified Theorem Prover Backend Supported by a Monotonic Library. LPAR 2018: 564-582 - [i2]Arnon Avron, Liron Cohen:
Applicable Mathematics in a Minimal Computational Theory of Sets. CoRR abs/1801.02387 (2018) - [i1]Liron Cohen, Reuben N. S. Rowe:
Infinitary and Cyclic Proof Systems for Transitive Closure Logic. CoRR abs/1802.00756 (2018) - 2017
- [c4]Liron Cohen, Yoni Zohar:
Reasoning Inside The Box: Deduction in Herbrand Logics. GCAI 2017: 107-120 - [c3]Liron Cohen:
Completeness for Ancestral Logic via a Computationally-Meaningful Semantics. TABLEAUX 2017: 247-260 - 2016
- [j1]Arnon Avron, Liron Cohen:
Formalizing Scientifically Applicable Mathematics in a Definitional Framework. J. Formaliz. Reason. 9(1): 53-70 (2016) - 2015
- [c2]Liron Cohen, Robert L. Constable:
Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language. WoLLIC 2015: 14-26 - 2014
- [c1]Liron Cohen, Arnon Avron:
Ancestral Logic: A Proof Theoretical Study. WoLLIC 2014: 137-151
Coauthor Index
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-05-08 23:26 CEST 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:
