Welcome to the webpages of the Logic Group at the Institute of Computer Science of the Czech Academy of Sciences. The group is part of the Department of Theoretical Computer Science at the ICS.
News
- We're hiring! See the ICS Tenure Track Position call. Deadline: 31 May 2021.
- We're hiring! See the ICS Postdoctoral Position call. Deadline: 31 May 2021.
- Upcoming talks in the Seminar on Applied Mathematical Logic (* Bern-Prague joint seminar):
- April 14 Hitoshi Omori (Ruhr University Bochum): Two applications of Herzberger’s semantics
- April 21* Federico Faroldi (Ghent University and University of Salzburg): T.B.A.
- April 28* Iris van der Giessen (Utrecht University): T.B.A.
- May 26 Grigory Olkhovikov (Ruhr University Bochum): T.B.A.
Recent publications
- G. Badia, P. Cintula, P. Hájek, and A. Tedder: How much propositional logic suffices for Rosser's undecidability theorem? Forthcoming in the Review of Symbolic Logic.
- I. Sedlár: Finitely-valued propositional dynamic logics. Forthcoming in Advances in Modal Logic 13.
- I. Sedlár and A. Tedder: Lambek Calculus with conjugates. Forthcoming in Studia Logica.
- G. Paterson, D.W. Ripley, and A. Tedder: Qua solution, 0-Qua has problems. Forthcoming in the Journal of Analytic Theology.
- M. Bílková and A. Colacito: Proof theory for positive logic with weak negation. Studia Logica 108, 649-686, 2020.
- P. Cintula, J. Gil Férez, T. Moraschini, F. Paoli: An abstract approach to consequence relations. The Review of Symbolic Logic 12(2), 331-371, 2019.
- P. Cintula, D. Diaconecsu, G. Metcalfe: Skolemization and Herbrand theorems for lattice-valued logics. Theoretical Computer Science 768, 54–75, 2019.
- Z. Haniková: Implicit definability of truth constants in Łukasiewicz logic. Soft Computing 23, 2279-2287, 2019.