default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd WoLLIC 2016: Puebla, Mexico
- Jouko A. Väänänen, Åsa Hirvonen
, Ruy J. G. B. de Queiroz:
Logic, Language, Information, and Computation - 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings. Lecture Notes in Computer Science 9803, Springer 2016, ISBN 978-3-662-52920-1 - Beniamino Accattoli:
The Useful MAM, a Reasonable Implementation of the Strong λ-Calculus. 1-21 - Juan P. Aguilera:
Compactness in Infinitary Gödel Logics. 22-35 - Juan P. Aguilera, Matthias Baaz:
Cut Elimination for Gödel Logic with an Operator Adding a Constant. 36-51 - Holger Bock Axelsen, Robert Glück, Robin Kaarsgaard:
A Classical Propositional Logic for Reasoning About Reversible Logic Circuits. 52-67 - John T. Baldwin:
Foundations of Mathematics: Reliability and Clarity: The Explanatory Role of Mathematical Induction. 68-82 - Alexandru Baltag, Nick Bezhanishvili, Aybüke Özgün, Sonja Smets:
Justified Belief and the Topology of Evidence. 83-103 - Pablo Barceló:
Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints. 104-108 - Marta Bílková, Matej Dostál:
Expressivity of Many-Valued Modal Logics, Coalgebraically. 109-124 - Torben Braüner, Patrick Blackburn, Irina Polyanskaya:
Second-Order False-Belief Tasks: Analysis and Formalization. 125-144 - Willem Conradie, Sabine Frittella, Alessandra Palmigiano, Michele Piazzai, Apostolos Tzimoulis, Nachoem Wijnberg:
Categories: How I Learned to Stop Worrying and Love Two Sorts. 145-164 - Jukka Corander, Antti Hyttinen, Juha Kontinen, Johan Pensar, Jouko Väänänen:
A Logical Approach to Context-Specific Independence. 165-182 - Anuj Dawar, Simone Severini, Octavio Zapata:
Descriptive Complexity of Graph Spectra. 183-199 - Mateus de Oliveira Oliveira:
Causality in Bounded Petri Nets is MSO Definable. 200-214 - Sabine Frittella, Giuseppe Greco, Alessandra Palmigiano, Fan Yang:
A Multi-type Calculus for Inquisitive Logic. 215-233 - Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. 234-248 - Ozan Kahramanogullari:
True Concurrency of Deep Inference Proofs. 249-264 - Zhe Lin, Minghui Ma:
On the Complexity of the Equational Theory of Residuated Boolean Algebras. 265-278 - Johann A. Makowsky, Elena V. Ravve:
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic. 279-296 - Maicol A. Ochoa, Andrés Villaveces:
Sheaves of Metric Structures. 297-315 - Konstantinos Pouliasis:
A Curry-Howard View of Basic Justification Logic. 316-337 - Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida:
On the Formalization of Some Results of Context-Free Language Theory. 338-357 - Deniz Rudin, Karl DeVries, Karen Duek, Kelsey Kraus, Adrian Brasoveanu:
The Semantics of Corrections. 358-374 - Raine Rönnholm:
The Expressive Power of k-ary Exclusion Logic. 375-391 - Katsuhiko Sano, Jonni Virtema:
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality. 392-409 - Fan Yang:
Negation and Partial Axiomatizations of Dependence and Independence Logic Revisited. 410-431 - Richard Zuber:
Anaphors and Quantifiers. 432-445
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 2024-12-19 22:18 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:
