Artemov, Sergei (ed.); Nerode, Anil (ed.) Logical foundations of computer science. International symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018. Proceedings. (English) Zbl 1383.03005 Lecture Notes in Computer Science 10703. Cham: Springer (ISBN 978-3-319-72055-5/pbk; 978-3-319-72056-2/ebook). x, 369 p. (2018). Show indexed articles as search result. The articles of this volume will be reviewed individually. For LFCS 2016 see [Zbl 1364.03006].Indexed articles:Achilleos, Antonis, The completeness problem for modal logic, 1-21 [Zbl 1443.03017]Artemov, Sergei, Justification awareness models, 22-36 [Zbl 1503.03029]Avron, Arnon; Cohen, Liron, A minimal computational theory of a minimal computational universe, 37-54 [Zbl 1503.03011]Baaz, Matthias; Leitsch, Alexander; Lolic, Anela, A sequent-calculus based formulation of the extended first epsilon theorem, 55-71 [Zbl 1503.03044]Barlocco, Simone; Kupke, Clemens, Angluin learning via logic, 72-90 [Zbl 1503.68083]Beklemishev, Lev D., A universal algebra for the variable-free fragment of \({\mathrm{RC}^\nabla}\), 91-106 [Zbl 1505.03132]Brünnler, Kai; Flumini, Dandolo; Studer, Thomas, A logic of blockchain updates, 107-119 [Zbl 1503.68049]Ciabattoni, Agata; Lyon, Tim; Ramanayake, Revantha, From display to labelled proofs for tense logics, 120-139 [Zbl 1503.03031]Diener, Hannes; Lubarsky, Robert, Notions of Cauchyness and metastability, 140-153 [Zbl 1503.03048]Ferguson, Thomas Macaulay, A Gödel-Artemov-style analysis of constructible falsity, 154-169 [Zbl 1505.03052]Ghilezan, Silvia; Ivetić, Jelena; Kašterović, Simona; Ognjanović, Zoran; Savić, Nenad, Probabilistic reasoning about simply typed lambda terms, 170-189 [Zbl 1505.03035]Hannula, Miika; Kontinen, Juha; Virtema, Jonni, Polyteam semantics, 190-210 [Zbl 1505.03070]Krupski, Vladimir N., On the sharpness and the single-conclusion property of basic justification models, 211-220 [Zbl 1503.03030]Liu, Yanhong A.; Stoller, Scott D., Founded semantics and constraint semantics of logic rules, 221-241 [Zbl 1503.68178]Lubarsky, Robert S., Separating the fan theorem and its weakenings. II, 242-255 [Zbl 1480.03029]de Paiva, Valeria; Eades, Harley III, Dialectica categories for the Lambek calculus, 256-272 [Zbl 1503.03032]Peluce, V. Alexis, From epistemic paradox to doxastic arithmetic, 273-288 [Zbl 1505.03056]Ralph, Benjamin, A natural proof system for Herbrand’s theorem, 289-308 [Zbl 1503.03045]Sanders, Sam, Metastability and higher-order computability, 309-330 [Zbl 1503.03040]Statman, Rick, The completeness of BCD for an operational semantics, 331-336 [Zbl 1505.03036]Yu, Junhua, A tableau system for instantial neighborhood logic, 337-353 [Zbl 1503.03033]Zapryagaev, Alexander; Pakhomov, Fedor, Interpretations of Presburger arithmetic in itself, 354-367 [Zbl 1503.03046] Cited in 1 Review MSC: 03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations 03B70 Logic in computer science 00B25 Proceedings of conferences of miscellaneous specific interest Citations:Zbl 1364.03006 PDFBibTeX XMLCite \textit{S. Artemov} (ed.) and \textit{A. Nerode} (ed.), Logical foundations of computer science. International symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8--11, 2018. Proceedings. Cham: Springer (2018; Zbl 1383.03005) Full Text: DOI