Vitezslav Svejdar, Publications

List of Publications

Download: sv.bib - BibTeX file

Relatives of Robinson Arithmetic. In M. Peliš, ed., The Logica Yearbook 2008, pp. 253-263. College Publications, London, 2009. Paper-efficient version, conference talk.
Weak Theories and Essential Incompleteness. In M. Peliš, ed., The Logica Yearbook 2007, pp. 213-224. Filosofia, Praha, 2008. Postscript (two pages per sheet), conference talk.
An Interpretation of Robinson Arithmetic in its Grzegorczyk's Weaker Variant. Fundamenta Informaticae, 81(1-3):347-354, 2007. Author-created version in pdf, or in postscript (two pages per sheet).
Gödel-Dummett Predicate Logics and Axioms of Prenexability. In O. Tomala and R. Honzík, eds., The Logica Yearbook 2006, pp. 251-260. Filosofia, Praha, 2007. Postscript (two pages per sheet), conference talk.
On Modal Systems with Rosser Modalities. In M. Bílková and O. Tomala, eds., The Logica Yearbook 2005, pp. 203-214. Filosofia, Praha, 2006. Postscript (two pages per sheet), conference talk.
On Sequent Calculi for Intuitionistic Propositional Logic. Comm. Math. Univ. Carolinae, 47(1):159-173, 2006. Postscript (two pages per sheet).
With Blanka Kozlikova, On Interplay of Quantifiers in Gödel-Dummett Fuzzy Logics. Archive for Math. Logic, 45(5):569-580, 2006.

in pdf

postscript

Note on Inter-Expressibility of Logical Connectives in Finitely-Valued Gödel-Dummett Logics. Soft Computing, 10(7):629-630, 2006. Author-created version in pdf, or in postscript (two pages per sheet).
Gödlov prvi izrek o nepolnosti. Obzornik za matematiko in fyziko, 51(4):113-121, 2004.
The limit lemma in fragments of arithmetic. Comm. Math. Univ. Carolinae, 44(3):565-568, 2003. Postscript (two pages per sheet).
A note on arithmetical completeness of theories with Rosser modalities. In K. Bendova and P. Jirku, editors, Miscellanea logica V, pages 123-132. Karolinum, Praha, 2003. ISBN 80-246-0799-9.
On structural proofs of Gödel First Incompleteness Theorem. In K. Bendova and P. Jirku, editors, Miscellanea logica V, pages 115-122. Karolinum, Praha, 2003. ISBN 80-246-0799-9.
The decision problem of provability logic with only one atom. Archive for Math. Logic, 42(8):763-768, 2003. Author-created version in pdf, or in postscript (two pages per sheet).
Errata: The final paragraph, just before the list of references, contains an unpleasant misprint: 'added in January 2002', should be 'added in January 2003'. My apologies!
On the polynomial-space completeness of intuitionistic propositional logic. Archive for Math. Logic, 42(7):711-716, 2003. Author-created version in pdf, or in postscript (two pages per sheet).
Logika: neúplnost, složitost a nutnost (Logic: Incompleteness, Complexity, and Necessity), Academia Praha, 2002. A Czech university textbook in logic. From propositional and predicate logic to metamathematics of Peano Arithmetic and some non-classical logics, with an emphasis on connections to theoretical computer science, 464 pages. Includes a section about Gödel-Dummett fuzzy logic, written by Petr Hajek.
With K. Bendova, On Inter-Expressibility of Logical Connectives in Gödel Fuzzy Logic. Soft Computing, 4(2):103-105, 2000. Authors-created version in pdf, or in postscript (two pages per sheet).
On Provability Logic. Nordic Journal of Philosophical Logic, 4(2):95-116, 2000.

in pdf

postscript

Arithmetical Classification of the Set of All Provably Recursive Functions. Comm. Math. Univ. Carolinae, 40(4):631-634, 1999. Postscript (two pages per sheet).
Poznamka o vztahu vyplyvani v klasicke predikatove logice (A Note on the Consequence Relation in Classical Predicate Logic). In P. Jirku and V. Svejdar, editors, Miscellanea Logica II. Karolinum, Praha, 1999. In Czech.
Logika v aritmetice. In P. Jirku and V. Svejdar, editors, Miscellanea Logica I. Karolinum, Praha, 1998. In Czech.
With P. Hajek, Matematicka logika (Mathematical Logic). Praha, November 1994. Lecture notes, electronic version. In Czech.
Some Independence Results in Interpretability Logic. Studia Logica, 50(1):29-38, 1991.
With P. Hajek, A Note on the Normal Form of Closed Formulas of Interpretability Logic. Studia Logica, 50(1):25-28, 1991.
Modal Analysis of Generalized Rosser Sentences. J. Symb. Logic, 48(4):986-999, 1983. JSTOR
A Sentence that is Difficult to Interpret. Comm. Math. Univ. Carolinae, 22(4):661-666, 1981.
Degrees of Interpretability. Comm. Math. Univ. Carolinae, 19(4):789-813, 1978.

Updated: by V.S.