default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th WoLLIC 2019: Utrecht, The Netherlands
- Rosalie Iemhoff, Michael Moortgat, Ruy J. G. B. de Queiroz:
Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings. Lecture Notes in Computer Science 11541, Springer 2019, ISBN 978-3-662-59532-9 - Matteo Acclavio
, Lutz Straßburger:
On Combinatorial Proofs for Logics of Relevance and Entailment. 1-16 - Bahareh Afshari, Gerhard Jäger, Graham E. Leigh:
An Infinitary Treatment of Full Mu-Calculus. 17-34 - Nick Bezhanishvili, Gianluca Grilletti, Wesley H. Holliday:
Algebraic and Topological Semantics for Inquisitive Logic via Choice-Free Duality. 35-52 - Patrick Blackburn, Manuel A. Martins, María Manzano, Antonia Huertas:
Rigid First-Order Hybrid Logic. 53-69 - Xavier Caicedo, George Metcalfe, Ricardo Oscar Rodríguez, Olim Frits Tuyt:
The One-Variable Fragment of Corsi Logic. 70-83 - Carlos Caleiro, Sérgio Marcelino:
Analytic Calculi for Monadic PNmatrices. 84-98 - Jinsheng Chen, Giuseppe Greco, Alessandra Palmigiano, Apostolos Tzimoulis:
Non Normal Logics: Semantic Analysis and Proof Theory. 99-118 - Roberto Ciuni, Thomas Macaulay Ferguson, Damián Enrique Szmuc:
Modeling the Interaction of Computer Errors by Four-Valued Contaminating Logics. 119-139 - Willem Conradie, Andrew Craig, Alessandra Palmigiano, Nachoem M. Wijnberg:
Modelling Informational Entropy. 140-160 - Jim de Groot, Dirk Pattinson:
Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic. 161-176 - Alexandru Baltag, Nick Bezhanishvili, Saúl Fernández González:
The McKinsey-Tarski Theorem for Topological Evidence Logics. 177-194 - David Fernández-Duque, Eduardo Hermo Reyes:
A Self-contained Provability Calculus for Γ0. 195-207 - Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema:
Descriptive Complexity of Deterministic Polylogarithmic Time. 208-222 - Tommaso Flaminio, Lluís Godo, Ricardo Oscar Rodríguez:
A Representation Theorem for Finite Gödel Algebras with Operators. 223-235 - Makoto Fujiwara:
Bar Induction and Restricted Classical Logic. 236-247 - Marianna Girlando, Sara Negri, Giorgio Sbardolini:
Uniform Labelled Calculi for Conditional and Counterfactual Logics. 248-263 - Sergey Bozhko, Leyla Khatbullina, Semyon V. Grigorev:
Bar-Hillel Theorem Mechanization in Coq. 264-281 - Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco:
Proof-Net as Graph, Taylor Expansion as Pullback. 282-300 - Miika Hannula, Lauri Hella:
Complexity Thresholds in Inclusion Logic. 301-322 - Steve Huntsman:
The Multiresolution Analysis of Flow Graphs. 323-341 - Raheleh Jalali:
An Exponential Lower Bound for Proofs in Focused Calculi. 342-355 - Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later. 356-372 - Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit. 373-391 - Juha Kontinen, Fan Yang:
Logics for First-Order Team Properties. 392-414 - Yusuke Kubota, Robert Levine:
Modal Auxiliaries and Negation: A Type-Logical Account. 415-432 - Eveline Lehmann, Thomas Studer:
Subset Models for Justification Logic. 433-449 - Fei Liang, Thiago Nascimento:
Algebraic Semantics for Quasi-Nelson Logic. 450-466 - Kristina Liefke:
A Case for Property-Type Semantics. 467-485 - Matthias Baaz, Anela Lolic:
Note on Globally Sound Analytic Calculi for Quantifier Macros. 486-497 - Gian Carlo Milanese, Yde Venema:
Closure Ordinals of the Two-Way Modal µ-Calculus. 498-515 - Hitoshi Omori, Daniel Skurt:
SIXTEEN _3 in Light of Routley Stars. 516-532 - Thomas Powell, Peter Schuster, Franziskus Wiesnet:
An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra. 533-549 - Sam Sanders:
Reverse Mathematics and Computability Theory of Domain Theory. 550-568 - Yury Savateev, Daniyar S. Shamkanov:
Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs. 569-583 - Denis I. Saveliev:
On First-Order Expressibility of Satisfiability in Submodels. 584-593 - Igor Sedlár:
Substructural Propositional Dynamic Logics. 594-609 - Ilya Shapirovsky:
Modal Logics of Finite Direct Powers of \omega Have the Finite Model Property. 610-618 - Hans van Ditmarsch, Louwe B. Kuijer:
Knowledge Without Complete Certainty. 619-632 - Noortje J. Venhuizen, Petra Hendriks, Matthew W. Crocker, Harm Brouwer:
A Framework for Distributional Formal Semantics. 633-646 - Richard Zuber:
Weak Conservativity. 647-660
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-11 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
