


default search action
19th WoLLIC 2012: Buenos Aires, Argentina
- C.-H. Luke Ong

, Ruy J. G. B. de Queiroz:
Logic, Language, Information and Computation - 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7456, Springer 2012, ISBN 978-3-642-32620-2
Invited Papers and Abstracts of Invited Lectures
- Andrea Asperti

, Wilmer Ricciotti:
Formalizing Turing Machines. 1-25 - Ekaterina B. Fokina

, Sy-David Friedman, André Nies
:
Equivalence Relations That Are Σ03 Complete for Computable Reducibility - (Extended Abstract). 26-33 - Laura Kallmeyer, Rainer Osswald:

An Analysis of Directed Motion Expressions with Lexicalized Tree Adjoining Grammars and Frame Semantics. 34-55 - George Metcalfe

:
Admissible Rules: From Characterizations to Applications. 56-69 - Volker Diekert, Anca Muscholl:

On Distributed Monitoring of Asynchronous Systems. 70-84 - Nicole Schweikardt:

On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates. 85-87 - Peter Selinger:

Logical Methods in Quantum Information Theory. 88 - Hans van Ditmarsch:

Quantifying Notes. 89-109
Contributed Papers
- Sergio Abriola, Santiago Figueira

, Gabriel Senno
:
Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders. 110-126 - Benedikt Ahrens

:
Initiality for Typed Syntax and Semantics. 127-141 - Carlos Areces

, Raul Fervari
, Guillaume Hoffmann:
Moving Arrows and Four Model Checking Results. 142-153 - Paolo Baldi

, Agata Ciabattoni
, Lara Spendier:
Standard Completeness for Extensions of MTL: An Automated Approach. 154-167 - Alexandru Baltag, Bryan Renne, Sonja Smets

:
The Logic of Justified Belief Change, Soft Evidence and Defeasible Knowledge. 168-190 - Nick Bezhanishvili

, Clemens Kupke
, Prakash Panangaden:
Minimization via Duality. 191-205 - Claudio Callejas, João Marcos

, Benjamín René Callejas Bedregal:
On Some Subclasses of the Fodor-Roubens Fuzzy Bi-implication. 206-215 - Alejandro Díaz-Caro

, Barbara Petit:
Linearity in the Non-deterministic Call-by-Value Setting. 216-231 - Amin Farjudian

:
Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures. 232-245 - Willem L. Fouché

:
Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures. 246-256 - Sebastian Link

:
Propositional Reasoning about Saturated Conditional Probabilistic Independence. 257-267 - Márcio Moretto Ribeiro

, Marcelo E. Coniglio
:
Contracting Logics. 268-281 - Benjamin Rossman:

A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs. 282-290 - Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty

:
Preservation under Substructures modulo Bounded Cores. 291-305 - Luis Menasché Schechter:

A Logic of Plausible Justifications. 306-320 - Marco Volpe, João Marcos

, Carlos Caleiro
:
Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics. 321-335

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














