Search results
- 1.0585222 - ÚI 2025 GB eng J - Journal Article
Cintula, Petr - Metcalfe, G. - Tokuda, N.
One-variable fragments of first-order logics.
Bulletin of Symbolic Logic. Online 01 April 2024 (2024). ISSN 1079-8986. E-ISSN 1943-5894
R&D Projects: GA ČR(CZ) GA22-01137S
EU Projects: European Commission(XE) 101007627 - MOSAIC
Institutional support: RVO:67985807
Keywords : First-Order Logic * One-Variable Fragment * Modal Logic * Substructural Logic * Superamalgamation * Sequent Calculus
OECD category: Pure mathematics
Impact factor: 0.6, year: 2022
Method of publishing: Open access
https://doi.org/10.1017/bsl.2024.22
Permanent Link: https://hdl.handle.net/11104/0352990 - 2.0560680 - ÚI 2024 RIV GB eng C - Conference Paper (international conference)
Cintula, Petr - Metcalfe, G. - Tokuda, N.
Algebraic Semantics for One-Variable Lattice-Valued Logics.
Advances in Modal Logic. Volume 14. London: College Publications, 2022 - (Fernández-Duque, D.; Palmigiano, A.; Pinchinat, S.), s. 237-257. ISBN 978-1-84890-413-2.
[AIML 2022: Advances in Modal Logic. Rennes (FR), 22.08.2022-25.08.2022]
R&D Projects: GA ČR(CZ) GA22-01137S
Institutional support: RVO:67985807
Keywords : Modal Logic * Substructural Logics * Lattice-Valued Logics * One-Variable Fragment * Superamalgamation * Sequent Calculus * Interpolation
OECD category: Pure mathematics
http://www.collegepublications.co.uk/aiml/?00011
Permanent Link: https://hdl.handle.net/11104/0333542 - 3.0507205 - ÚI 2020 US eng C - Conference Paper (international conference)
Beyersdorff, O. - Pich, Ján
Understanding Gentzen and Frege Systems for QBF.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. New York: ACM, 2016, s. 146-155. ISBN 978-1-4503-4391-6.
[LICS 2016. Annual ACM/IEEE Symposium on Logic in Computer Science /31./. New York City (US), 05.07.2016-08.07.2016]
Keywords : QBF proof systems * sequent calculus * Frege systems * intuitionistic logic * strategy extraction * lower bounds * simulations
Permanent Link: http://hdl.handle.net/11104/0298249 - 4.0505107 - ÚI 2021 RIV NL eng J - Journal Article
Bílková, Marta - Colacito, A.
Proof Theory for Positive Logic with Weak Negation.
Studia Logica. Roč. 108, č. 4 (2020), s. 649-686. ISSN 0039-3215. E-ISSN 1572-8730
R&D Projects: GA ČR GA17-04630S
Institutional support: RVO:67985807
Keywords : Minimal propositional logic * Weak negation * Intuitionistic propositional logic * Sequent calculus * Terminating sequent calculus * Decidability * Complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.585, year: 2020
Method of publishing: Limited access
http://dx.doi.org/10.1007/s11225-019-09869-y
Permanent Link: http://hdl.handle.net/11104/0296624 - 5.0377738 - MÚ 2013 RIV DE eng J - Journal Article
Jeřábek, Emil
Proofs with monotone cuts.
Mathematical Logic Quarterly. Roč. 58, č. 3 (2012), s. 177-187. ISSN 0942-5616. E-ISSN 1521-3870
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional support: RVO:67985840
Keywords : proof complexity * monotone sequent calculus
Subject RIV: BA - General Mathematics
Impact factor: 0.376, year: 2012
http://onlinelibrary.wiley.com/doi/10.1002/malq.201020071/full
Permanent Link: http://hdl.handle.net/11104/0209826File Download Size Commentary Version Access Jerabek.pdf 1 157.8 KB Publisher’s postprint require - 6.0353276 - MÚ 2011 RIV NL eng J - Journal Article
Jeřábek, Emil
A sorting network in bounded arithmetic.
Annals of Pure and Applied Logic. Roč. 162, č. 4 (2011), s. 341-355. ISSN 0168-0072. E-ISSN 1873-2461
R&D Projects: GA AV ČR IAA1019401; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded arithmetic * sorting network * proof complexity * monotone sequent calculus
Subject RIV: BA - General Mathematics
Impact factor: 0.450, year: 2011
http://www.sciencedirect.com/science/article/pii/S0168007210001272
Permanent Link: http://hdl.handle.net/11104/0192567File Download Size Commentary Version Access Jerabek.pdf 1 306.7 KB Publisher’s postprint require - 7.0323402 - MÚ 2009 RIV GB eng J - Journal Article
Jeřábek, Emil
Proof Complexity of the Cut-free Calculus of Structures.
[Důkazová složitost bezřezového kalkulu struktur.]
Journal of Logic and Computation. Roč. 19, č. 2 (2009), s. 323-339. ISSN 0955-792X. E-ISSN 1465-363X
Institutional research plan: CEZ:AV0Z10190503
Keywords : proof complexity * calculus of structures * monotone sequent calculus
Subject RIV: BA - General Mathematics
Impact factor: 0.789, year: 2009
Permanent Link: http://hdl.handle.net/11104/0171376