Kein Profilbild | No profile picture | Utilisateur n'as pas d'image
https://www.philosophie.ch/profil/svejdar

Vítězslav Švejdar

Bibliography

    Švejdar, Vı́tězslav. 1991. Some Independence Results in Interpretability Logic.” Studia Logica: An International Journal for Symbolic Logic 50: 29–38.
    Švejdar, Vı́tězslav. 2000. On Provability Logic.” Nordic Journal of Philosophical Logic 4: 95–116.
    Švejdar, Vı́tězslav. 2006. On Modal Systems with Rosser Modalities.” in The Logica Yearbook 2005, edited by Marta Bı́lková and Ondřej Tomala, pp. 203–214. Praha: Filosofia. Nakladetelstvı́ Filosofického ústavu AV ČR.
    Švejdar, Vı́tězslav. 2007. Gödel-Dummett Predicate Logics and Axioms of Prenexability.” in The Logica Yearbook 2006, edited by Ondřej Tomala and Radek Honzı́k, pp. 251–260. Praha: Filosofia. Nakladetelstvı́ Filosofického ústavu AV ČR.
    Švejdar, Vı́tězslav. 2008. Weak Theories and Essential Incompleteness.” in The Logica Yearbook 2007, edited by Michal Peliš, pp. 213–224. Praha: Filosofia. Nakladetelstvı́ Filosofického ústavu AV ČR.
    Švejdar, Vı́tězslav. 2009. Relatives of Robinson Arithmetic.” in The Logica Yearbook 2008, edited by Michal Peliš, pp. 253–264. London: College Publications.
    Švejdar, Vı́tězslav. 2010. Decision Problems of some Intermediate Logics and Their Fragments.” in The Logica Yearbook 2009, edited by Michal Peliš, pp. 297–297. London: College Publications.
    Švejdar, Vı́tězslav. 2011. Infinite Natural Numbers: an Unwanted Phenomenon, or a Useful Concept? in The Logica Yearbook 2010, edited by Michal Peliš and Vı́t Punčochář, pp. 283–294. London: College Publications.
    Švejdar, Vı́tězslav. 2015. On Strong Fragments of Peano Arithmetic.” in The Logica Yearbook 2014, edited by Pavel Arazim and Michal Dančák, pp. 281–292. London: College Publications.
    Švejdar, Vı́tězslav. 2020. Do we need Recursion? in The Logica Yearbook 2019, edited by Igor Sedlár and Martin Blicha, pp. 193–204. London: College Publications.