Anela Lolic

Proceedings of the Logic, Language, Information, and Computation, 2023

2022

Towards a proof theory for quantifier macros.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Andrews Skolemization May Shorten Resolution Proofs Non-elementarily.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021

Towards a proof theory for Henkin quantifiers.

[BibT_eX]

[DOI]

J. Log. Comput., 2021

Schematic Refutations of Formula Schemata.

[BibT_eX]

[DOI]

David M. Cerna

J. Autom. Reason., 2021

2020

First-order interpolation derived from propositional interpolation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

An abstract form of the first epsilon theorem.

[BibT_eX]

[DOI]

J. Log. Comput., 2020

On the Unification of Term Schemata.

[BibT_eX]

[DOI]

David M. Cerna

Proceedings of the 34th International Workshop on Unification, 2020

A Globally Sound Analytic Calculus for Henkin Quantifiers.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019

Extraction of Expansion Trees.

[BibT_eX]

[DOI]

J. Autom. Reason., 2019

Note on Globally Sound Analytic Calculi for Quantifier Macros.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2019

2018

Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic.

[BibT_eX]

[DOI]

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017

First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation.

[BibT_eX]

[DOI]