default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 15
Volume 15, Number 1, 2019
- Dexter Kozen:
Natural Transformations as Rewrite Rules and Monad Composition. - Ian Orton, Andrew M. Pitts:
Models of Type Theory Based on Moore Paths.
- Thomas Ehrhard, Christine Tasson:
Probabilistic call by push value. - Erich Grädel, Martin Grohe, Benedikt Pago
, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. - Adriana Balan, Alexander Kurz, Jirí Velebil:
Extending set functors to generalised metric spaces. - Benedetto Intrigila, Giulio Manzonetto, Andrew Polonsky:
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture. - Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. - Paula Severi:
A Light Modality for Recursion. - Noam Zeilberger:
A sequent calculus for a semi-associative law. - Albert Atserias, José L. Balcázar, Marie Ely Piceno:
Relative Entailment Among Probabilistic Implications. - Andrei Bulatov, Peter Mayr, Ágnes Szendrei:
The Subpower Membership Problem for Finite Algebras with Cube Terms. - Lorenzo Clemente, Richard Mayr:
Efficient reduction of nondeterministic automata with application to language inclusion testing. - Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde:
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. - Michele Boreale:
Algebra, coalgebra, and minimization in polynomial differential equations. - Willem Conradie, Alessandra Palmigiano, Zhiguang Zhao:
Sahlqvist via Translation. - Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. - Tomasz Brengos, Marco Peressotti:
Behavioural equivalences for timed systems. - Simon Castellan, Pierre Clairambault, Glynn Winskel:
Thin Games with Symmetry and Concurrent Hyland-Ong Games. - Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. - Benedikt Ahrens, Peter LeFanu Lumsdaine:
Displayed Categories. - Pablo Cañones, Boris Köpf, Jan Reineke:
On the Incomparability of Cache Algorithms in Terms of Timing Leakage. - Tatsuji Kawai, Giovanni Sambin:
The principle of pointfree continuity. - Marcel Erné:
Web spaces and worldwide web spaces: topological aspects of domain theory. - Berit Grußien:
Capturing Polynomial Time using Modular Decomposition. - Oleg Verbitsky, Maksim Zhukovskii:
On the First-Order Complexity of Induced Subgraph Isomorphism. - Francesco Dagnino:
Coaxioms: flexible coinductive definitions by inference systems. - Simon Docherty, David J. Pym:
Stone-Type Dualities for Separation Logics. - Benedikt Ahrens:
Initial Semantics for Reduction Rules. - Hadrian Andradi, Weng Kin Ho:
Topological Scott Convergence Theorem. - Sebastian Enqvist, Yde Venema:
Disjunctive bases: normal forms and model theory for modal logics. - Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Proving Soundness of Extensional Normal-Form Bisimilarities. - David Reutter, Jamie Vicary:
A classical groupoid model for quantum networks. - Alan Jeffrey, James Riely:
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory. - Predrag Janicic, Filip Maric, Marko Malikovic:
Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture. - Dimiter Skordev:
Moschovakis Extension of Represented Spaces. - Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja:
Abstract Hidden Markov Models: a monadic account of quantitative information flow.
Volume 15, Number 2, 2019
- Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. - Martin Lück:
Canonical Models and the Complexity of Modal Team Logic. - Stefano Gogioso, William Zeng:
Generalised Mermin-type non-locality arguments. - Miika Hannula:
Validity and Entailment in Modal and Propositional Dependence Logics. - Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu:
All-Path Reachability Logic. - Prateek Karandikar, Philippe Schnoebelen:
The height of piecewise-testable languages and the complexity of the logic of subwords. - Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback computability on Cantor space. - Ian A. Mason, Carolyn L. Talcott:
Reasoning about effects: from lists to cyber-physical agents. - Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to word or tree automata. - Ryan Kavanagh, Stephen Brookes:
A Denotational Semantics for SPARC TSO. - Thomas Place, Varun Ramanathan, Pascal Weil:
Covering and separation for logical fragments with modular predicates. - Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. - Hsi-Ming Ho, Joël Ouaknine, James Worrell:
On the Expressiveness and Monitoring of Metric Temporal Logic. - Andrej Bauer, Andrew Swan:
Every metric space is separable in function realizability. - Cristina Feier, Antti Kuusisto, Carsten Lutz:
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. - Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. - David Cachera, Uli Fahrenberg, Axel Legay:
An ωω\omega-Algebra for Real-Time Energy Problems. - Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Bisimulations for Delimited-Control Operators. - Sandra Kiefer, Pascal Schweitzer:
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. - Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of One Counter Automata. - Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini:
Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies.
Volume 15, Number 3, 2019
- Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Guarded and Unguarded Iteration for Generalized Processes. - Berit Grußien:
Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs. - Benjamin Rossman:
Subspace-Invariant AC00^0 Formulas. - Anuj Dawar, Eryk Kopczynski:
Logical properties of random graphs from small addable classes. - Lawrence Dunn, Jamie Vicary:
Coherence for Frobenius pseudomonoids and the geometry of linear proofs. - Erwin Engeler:
A Forgotten Theory of Proofs ? - Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole:
Controlling a population. - Victor Marsault:
An efficient algorithm to decide periodicity of bbb-recognisable sets using LSDF convention. - Lionel Vaux:
Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors. - Stefano Berardi, Makoto Tatsuta:
Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs. - Hugo Nobrega, Arno Pauly:
Game characterizations and lower cones in the Weihrauch degrees. - Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and unique solution of equations. - Matthew de Brecht, Tatsuji Kawai:
On the commutativity of the powerspace constructions. - Damien Pous, Jurriaan Rot:
Companions, Causality and Codensity. - Aleks Kissinger, Sander Uijlen:
A categorical semantics for causal structure. - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. - Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. - Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham:
Bounded Quantifier Instantiation for Checking Inductive Invariants. - Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Abstract Completion, Formalized. - Sven Schewe, Alexander Weinert, Martin Zimmermann:
Parity Games with Weights. - Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query learning of derived ωω\omega-tree languages in polynomial time. - Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Alternating, private alternating, and quantum alternating realtime automata. - Carsten Lutz, Inanç Seylan, Frank Wolter:
The Data Complexity of Ontology-Mediated Queries with Closed Predicates. - Diogo Poças, Jeffery I. Zucker:
Approximability in the GPAC. - Thomas Seiller:
Interaction Graphs: Exponentials. - Giovanni de Felice, Amar Hadzihasanovic, Kang Feng Ng:
A diagrammatic calculus of fermionic quantum circuits. - Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak:
Regular tree languages in low levels of the Wadge Hierarchy. - Thomas Kahl:
Higher-dimensional automata modeling shared-variable systems. - Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Definability and Interpolation within Decidable Fixpoint Logics. - Sergey Slavnov:
On noncommutative extensions of linear logic. - Yijia Chen, Michael Elberfeld, Moritz Müller:
The parameterized space complexity of model-checking bounded variable first-order logic. - Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge:
Nash Equilibrium and Bisimulation Invariance. - Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
The Complexity of Flat Freeze LTL.
Volume 15, Number 4, 2019
- Maria João Gouveia, Luigi Santocanale:
ℵ1 and the modal μ-calculus. - Luca Aceto, Ignacio Fábregas, Álvaro García-Pérez, Anna Ingólfsdóttir, Yolanda Ortega-Mallén:
Rule Formats for Nominal Process Calculi. - Maciej Bendkowski, Pierre Lescanne:
On the enumeration of closures and environments with an application to random generation. - Zoltán Ésik, Dexter Kozen:
On Free ω-Continuous and Regular Ordered Algebras. - Bartek Klin, Mateusz Lelyk:
Scalar and Vectorial mu-calculus with Atoms. - Paolo Pistone:
On completeness and parametricity in the realizability semantics of System F. - Koko Muroya, Dan R. Ghica:
The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter. - Jean-Simon Pacaud Lemay:
Lifting Coalgebra Modalities and MELL Model Structure to Eilenberg-Moore Categories. - Orna Kupferman, Gal Vardi:
Flow Logic. - Mikolaj Bojanczyk, Bartek Klin:
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. - Denis Kuperberg, Anirban Majumdar:
Computing the Width of Non-deterministic Automata. - Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. - Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. - Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. - Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. - Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. - Roberto Bruni, Hernán C. Melgratti, Ugo Montanari:
Concurrency and Probability: Removing Confusion, Compositionally. - Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub:
Relational ⋆⋆\star-Liftings for Differential Privacy.
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-01-24 17:04 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:
