Liron Cohen

Orcid: 0000-0002-6608-3000

Affiliations:
  • Ben-Gurion University of the Negev, Beer-Sheva, Israel
  • Cornell University, Ithaca, NY, USA (2016 - 2018)
  • Tel Aviv University, Israel (PhD 2016)


According to our database1, Liron Cohen authored at least 31 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Complex(ity) Landscape of Checking Infinite Descent.
Proc. ACM Program. Lang., January, 2024

$\text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity.
Log. Methods Comput. Sci., 2024

Separating Markov's Principles.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
TT<sup>☐</sup><sub>C</sub>: a Family of Extensional Type Theories with Effectful Realizers of Continuity.
CoRR, 2023

Uncertainty Estimation based on Geometric Separation.
CoRR, 2023

Inductive Continuity via Brouwer Trees.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Realizing Continuity Using Stateful Computations.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
A geometric method for improved uncertainty estimation in real-time.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Constructing Unprejudiced Extensional Type Theories with Choices via Modalities.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Evidenced Frames: A Unifying Framework Broadening Realizability Models.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Formally Computing with the Non-computable.
Proceedings of the Connecting with Computability, 2021

Non-well-founded Deduction for Induction and Coinduction.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Non-well-founded Proof Theory of Transitive Closure Logic.
ACM Trans. Comput. Log., 2020

Integrating Induction and Coinduction via Closure Operators and Proof Cycles.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
The middle ground-ancestral logic.
Synth., 2019

Intuitionistic ancestral logic.
J. Log. Comput., 2019

Towards automated reasoning in Herbrand structures.
J. Log. Comput., 2019

Bar Induction is Compatible with Constructive Type Theory.
J. ACM, 2019

The Effects of Effects on Constructivism.
Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

2018
Applicable Mathematics in a Minimal Computational Theory of Sets.
Log. Methods Comput. Sci., 2018

Infinitary and Cyclic Proof Systems for Transitive Closure Logic.
CoRR, 2018

A Verified Theorem Prover Backend Supported by a Monotonic Library.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Computability Beyond Church-Turing via Choice Sequences.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Minimal Computational Theory of a Minimal Computational Universe.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Completeness for Ancestral Logic via a Computationally-Meaningful Semantics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Reasoning Inside The Box: Deduction in Herbrand Logics.
Proceedings of the GCAI 2017, 2017

2016
Formalizing Scientifically Applicable Mathematics in a Definitional Framework.
J. Formaliz. Reason., 2016

2015
Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language.
Proceedings of the Logic, Language, Information, and Computation, 2015

2014
Ancestral Logic: A Proof Theoretical Study.
Proceedings of the Logic, Language, Information, and Computation, 2014


  Loading...