default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 1
Volume 1, Number 1, 2005
- Michael Huth:
Labelled transition systems as a Stone space. - Jörg Flum, Martin Grohe
:
Model-checking problems as a basis for parameterized intractability. - Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. - Alan Jeffrey, Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited. - Víctor Dalmau:
Linear datalog and bounded path duality of relational structures. - Martin Grohe, Nicole Schweikardt:
The succinctness of first-order logic on linear orders.
Volume 1, Number 2, 2005
- Venanzio Capretta:
General recursion via coinductive types. - Erik Palmgren:
Internalising modified realisability in constructive type theory. - Ulrich Berger:
Strong normalization for applied lambda calculi. - Dag Normann:
Comparing hierarchies of total functionals. - Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. - Sanjit A. Seshia, Randal E. Bryant:
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds.
Volume 1, Number 3, 2005
- Joseph Y. Halpern, Riccardo Pucella:
Probabilistic Algorithmic Knowledge. - Daniele Gorla, Matthew Hennessy, Vladimiro Sassone:
Security Policies as Membranes in Systems for Global Computing. - Bas Spitters:
Almost periodic functions, constructively. - Christopher Hardin:
Modularizing the Elimination of r=0 in Kleene Algebra.
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 2025-03-11 20:12 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:
