default search action
22nd WoLLIC 2015: Bloomington, IN, USA
- Valeria de Paiva, Ruy J. G. B. de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina Grisi de Oliveira:
Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings. Lecture Notes in Computer Science 9160, Springer 2015, ISBN 978-3-662-47708-3 - James M. Belk, Robert W. McGrail:
The Word Problem for Finitely Presented Quandles is Undecidable. 1-13 - Liron Cohen, Robert L. Constable:
Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language. 14-26 - Bernhard Heinemann:
On Topologically Relevant Fragments of the Logic of Linear Flows of Time. 27-37 - Andreia Mordido, Carlos Caleiro:
An Equation-Based Classical Logic. 38-52 - Vito Michele Abrusci, Roberto Maieli:
Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing. 53-68 - Ronald de Haan, Jakub Szymanik:
A Dichotomy Result for Ramsey Quantifiers. 69-80 - Neil Ghani, Fredrik Nordvall Forsberg, Federico Orsanigo:
Parametric Polymorphism - Universally. 81-92 - Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
On the Weak Index Problem for Game Automata. 93-108 - Philippe de Groote:
Proof-Theoretic Aspects of the Lambek-Grishin Calculus. 109-123 - Jörg Endrullis, Lawrence S. Moss:
Syllogistic Logic with "Most". 124-139 - Katsuhiko Sano, Jonni Virtema:
Characterizing Frame Definability in Team Semantics via the Universal Modality. 140-155 - Jean-René Courtault, Hans van Ditmarsch, Didier Galmiche:
An Epistemic Separation Logic. 156-173 - Zoltán Ésik:
Equational Properties of Stratified Least Fixed Points (Extended Abstract). 174-188 - Prasit Bhattacharya:
The p-adic Integers as Final Coalgebra. 189-199
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.