I am a researcher at the Department of Theoretical Computer Science.
My infocard here at the Institute.
I work in mathematical logic, theoretical computer science, and history and philosophy of logic.
Postal address: Institute of Computer Science, 182 07 Prague, Czechia.
The MaxSAT Problem in the Real-Valued MV-algebra (with Felip Manyà and Amanda Vidal). Accepted to TABLEAUX 2023.
Rational Pavelka logic: the best among three worlds? Fuzzy sets and systems 456, 92-106, 2023. Published version.
Structural completeness in many-valued logics with rational constants (with Joan Gispert, Tommaso Moraschini, and Michal Stronkowski). Notre Dame Journal of Formal Logic 63 (3), 261-299, 2022. Published version.
Vopěnkova Alternativní teorie množin v matematickém kánonu 20. století, Filosofický časopis 70(3), 485-504, 2022. Open access. English translation [Vopěnka's Alternative Set Theory in the canon of 20th century mathematics] available on the ArXiv.
Implicit definability of truth constants in Łukasiewicz logic, Soft Computing 23(7), 2279-2287, 2019. Published version.
Complexity of some language fragments of fuzzy logics, Soft Computing 21(1), 69-77, 2017. Published version.
Term satisfiability in FLew-algebras, Theoretical Computer Science 31, 1-15, 2016 (with Petr Savický). Published version.
The Finite Embeddability Property for Residuated Groupoids (with Rostislav Horčík). Algebra Universalis 72(1), 1-13, 2014. Published version.
Varieties generated by standard BL-algebras, Order 31(1), 15-33, 2014. Published version.
Expanding Basic Fuzzy Logic with truth constants for component delimiters, Fuzzy Sets and Systems 197, pp. 95-107, 2011. Published version.
Interpreting Lattice-Valued Set Theory in Fuzzy Set Theory (with Petr Hájek), Logic Journal of the IGPL 21(1), 77-90, 2013. Published version.
Distinguishing standard SBL-algebras with involutive negations by propositional formulas (with Petr Savický), Math. Logic Quarterly 54(6), pp. 578-596, 2008. Published version.
Complexity Issues in Basic Logic (with Stefano Aguzzoli and Brunella Gerla). Soft Computing 9, pp. 919-934, 2005. Published version.
A note on the complexity of tautologies of individual t-algebras, Neural Network World, vol. 12, n. 5 (Special Issue on SOFSEM 2002).
Standard algebras for fuzzy propositional calculi, Fuzzy Sets and Systems, vol. 124, n.3 (2001). Published version.
Axiomatizations of standard algebras for fuzzy propositional calculi by use of truth constants. Journal of Electrical Engineering, vol. 51 (2000).
On the complexity of validity degrees in Łukasiewicz logic, Computability in Europe (CiE) 2020, Fisciano, June 2020. Published version (Springer LNCS).
On the complexity of propositional logics with an involutive negation, Third Conference of the EUSFLAT, Zittau, September 2003.
A set theory within fuzzy logic (with Petr Hájek). Multiple-Valued Logic. Proceedings. -- Los Alamitos, IEEE Computer Society 2001, pp. 319-323.
Witnessed Years. Essays in Honour of Petr Hájek. (with Petr Cintula and Vítězslav Švejdar). College Publications, London, 2010.
Set theory and arithmetic in fuzzy logic (with Libor Běhounek), in Petr Hájek on Mathematical Fuzzy Logic, Volume 6 of Outstanding Contributions to Logic, 63-89, 2015. Published version.
Petr Hájek: a scientific biography, in Petr Hájek on Mathematical Fuzzy Logic, Volume 6 of Outstanding Contributions to Logic, 63-89, 2015. Published version.
Computational complexity of propositional fuzzy logics, Chapter X of Handbook of Mathematical Fuzzy Logic, College Publications, pp. 793--851, 2011.
A Development of set theory in fuzzy logic (with Petr Hájek). Beyond Two: Theory and Applications of Multiple-Valued Logic (Ed.: Fitting M., Orlowska E.) -- Heidelberg, Physica-Verlag 2003, pp. 273-285.
Mathematical and Metamathematical Properties of Fuzzy Logic, PhD Thesis, Charles University in Prague, 2004.
Some contributions to axiomatizations of fuzzy propositional calculi, master thesis, Charles University in Prague, 1999.
Rozhodnutelnost Presburgerovy aritmetiky [Decidability of Presburger Arithmetic], bachelor thesis, Charles University in Prague, 1998.
Blind proxy voting. Technical report V1250, Institute of Computer Science CAS, 2017.
Recent talks and slides.Łukasiewicz Logic, Rational Pavelka Logic, and Logics with Graded Syntax. Czech Gathering of Logicians 2023, Ostrava, June 1 2023.
Logic4Peace: fundraising online Logic event for Peace, online, April 2022 (PC member).
Topology, Algebra and Categories in Logic (TACL) 2022 (PC member).
Computability in Europe (CiE) 2021 (PC member)
16th Congress on Logic, Methodology and Philosophy of Science and Technology (CLMPST 2019) (PC member)
Topology, Algebra and Categories in Logic (TACL) 2017 (OC member)
Gatherings of Logicians
The series of regional meetings was initiated in 2013 and is run by a joint effort of a group of local logicians. So far, the following meetings took place:
Czech Gathering of Logicians 2023.
Czech Gathering of Logicians 2022.
Kurt Gödel Day and Czech Gathering of Logicians 2021.
Prague Gathering of Logicians 2019.
Prague Gathering of Logicians and Beauty of Logic 2018.
Prague Gathering of logicians 2017.
Prague Gathering of Logicians 2016.
Prague Gathering of Logicians 2015.
Prague Gathering of Logicians 2014
Gathering of Prague Logicians 2013.
2021 (November) Open Doors Festival of the ICS: talk on Between small and large numbers.
2018 (November) Open Doors Festival of the ICS: talk on Petr Hájek and mathematical logic in Prague.
2013 (November) Open Doors Festival of the ICS: talk on Computers as creations of the human brain.
Membership in associations.
Union of Czech Mathematicians and Physicists (JČMF)
Otto Wichterle Award for young researchers (Academy of Sciences of the Czech Republic, 2009)