Stop the war!
Остановите войну!
for scientists:
default search action
LFCS 2013: San Diego, CA, USA
- Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings. Lecture Notes in Computer Science 7734, Springer 2013, ISBN 978-3-642-35721-3 - Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, Joshua Sack:
Compositional Reasoning for Multi-modal Logics. 1-15 - Evangelia Antonakos:
Explicit Generic Common Knowledge. 16-28 - Gilles Barthe, Juan Manuel Crespo, César Kunz:
Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification. 29-43 - Marc Bender, Jeffery I. Zucker:
Assignment Calculus: A Pure Imperative Language. 44-58 - Thomas Brihaye, Julie De Pril, Sven Schewe:
Multiplayer Cost Games with Simple Nash Equilibria. 59-73 - Alex Brik, Jeffrey B. Remmel:
Forward Chaining for Hybrid ASP. 74-88 - John Case, Sanjay Jain, Frank Stephan:
Effectivity Questions for Kleene's Recursion Theorem. 89-103 - Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Bounded Pseudorandomness. 104-118 - Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky:
Automated Support for the Investigation of Paraconsistent and Other Logics. 119-133 - Jean-René Courtault, Didier Galmiche:
A Modal BI Logic for Dynamic Resource Properties. 134-148 - Benoît Delahaye, Kim G. Larsen, Axel Legay:
Stuttering for Abstract Probabilistic Automata. 149-163 - Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani:
Call-by-Value Non-determinism in a Linear Logic Type Discipline. 164-178 - Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
The Wadge Hierarchy of Petri Nets ω-Languages. 179-193 - Konstantinos Georgatos:
Iterated Contraction Based on Indistinguishability. 194-205 - Jeroen P. Goudsmit:
A Note on Extensions: Admissible Rules via Semantics. 206-218 - Bernhard Heinemann:
Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference. 219-233 - Ping Hou, Hao Zheng:
Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems. 234-251 - Rutger Kuyper:
Computational Hardness of Validity in Probability Logic. 252-265 - Roman Kuznets, Thomas Studer:
Update as Evidence: Belief Expansion. 266-279 - Robert S. Lubarsky, Hannes Diener:
Separating the Fan Theorem and Its Weakenings. 280-295 - Bob Milnikel:
The Logic of Uncertain Justifications. 296-306 - Igor Sedlár:
Justifications, Awareness and Epistemic Dynamics. 307-318 - Alexey Sorokin:
Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars. 319-334 - Jean-Pierre Talpin, Jens Brandt, Mike Gemünde, Klaus Schneider, Sandeep K. Shukla:
Constructive Polychronous Systems. 335-349 - Çagil Tasdemir:
On Tolerance Analysis of Games with Belief Revision. 350-358 - Ren-June Wang:
Temporalizing Modal Epistemic Logic. 359-371 - Bruno Woltzenlogel Paleo:
Contextual Natural Deduction. 372-386 - Sebastian Wyman:
Conservatively Approximable Functions. 387-400 - Junhua Yu:
Self-referentiality in the Brouwer-Heyting-Kolmogorov Semantics of Intuitionistic Logic. 401-414
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.