Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Larchey-Wendling, Dominique - Laboratoire Lorrain de Recherche en Informatique et ses Applications (Loria), Université Henri Poincaré -Nancy-Université
WoD 2004 Preliminary Version Godel-Dummett counter-models
Resources, process calculi and Godel-Dummett logics
The Undecidability of Boolean BI through Phase Semantics (full version) Dominique Larchey-Wendling
Resource models and proof-search in Intuitionistic Linear Logic
Departement de formation doctorale en informatique Ecole doctorale IAEM Lorraine Preuves, refutations et contremodeles
STRIP: Structural sharing for efficient proof-search
Electronic Notes in Theoretical Computer Science ?? (2000) URL: http://www.elsevier.nl/locate/entcs/volume??.html 15 pages
Combining proof search and linear counter-model construction
Labelled Tableaux for Proofs and Models in BI logics
odel-Dummett counter-models
Countermodel search in GodelDummett logics Dominique LarcheyWendling
An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics
Under consideration for publication in Math. Struct. in Comp. Science Exploring the Relation between
Bounding resource consumption with Godel-Dummett logics
Counter-model search in Godel-Dummett logics Dominique Larchey-Wendling
Combining proof-search and counter-model construction for deciding Godel-Dummett logic
Structural sharing and efficient proof-search in propositional intuitionistic logic
Phase Semantics and the Undecidability of Boolean BI
Kripke Models of Boolean BI and Invertible Resources Dominique Larchey-Wendling, larchey@loria.fr
Refutations counter-models
FormulaeasResources Management for an Intuitionistic Theorem Prover
Hypersequents Procedure for basic hypersequents Decision procedure for hypersequents A new system for LCn A tableau sys Hypersequents and Countermodels
Some Remarks on Relations between Proofs and Games
Provability Intuitionistic
completeness Scienti que,
Electronic Notes in Theoretical Computer Science 17 (1998) URL: http://www.elsevier.nl/locate/entcs/volume17.html 18 pages
Relational semantics and nite models of separation logics
Expressivity properties of Boolean BI through relational models
Graph-based decision for Godel-Dummett logics Dominique Larchey-Wendling
Non-deterministic Semantics and the Undecidability of Boolean BI DOMINIQUE LARCHEY-WENDLING, LORIACNRS, Nancy, France
