Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Margarita V. Korovina, Oleg V. Kudinov |
Semantic Characterisations of Second-Order Computability over the Real Numbers. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Courtieu |
Normalized Types. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Virgile Mogbil |
Quadratic Correctness Criterion for Non-commutative Logic. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Alexei Kopylov, Aleksey Nogin |
Markov's Principle for Propositional Type Theory. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Ralph Matthes |
Monotone Inductive and Coinductive Constructors of Rank 2. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Galota, Heribert Vollmer |
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Baaz, Georg Moser |
On a Generalisation of Herbrand's Theorem. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Felix Klaedtke |
Decision Procedure for an Extension of WS1S. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
word languages, weak monadic second-order logic of one successor, WS1S, tree automata |
1 | Yijia Chen, Enshao Shen |
Capture Complexity by Partition. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Olivier Finkel |
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
blind counter automata, effective extension of the Wagner hierarchy, Wadge hierarchy, Wadge games, languages, topological properties |
1 | Samson Abramsky, Marina Lenisa |
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Grigore Rosu |
Complete Categorical Equational Deduction. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Martin Grohe, Stefan Wöhrle |
An Existential Locality Theorem. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Alessandro Armando, Silvio Ranise, Michaël Rusinowitch |
Uniform Derivation of Decision Procedures by Superposition. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
Arrays with Extensionality, Term Rewriting, Decision Procedures, Homomorphism, Automated Deduction, Lists, Superposition, Equational Logic |
1 | Frank S. de Boer, Rogier M. van Eijk |
Decidable Navigation Logics for Object Structures. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Alessio Guglielmi, Lutz Straßburger |
Non-commutativity and MELL in the Calculus of Structures. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Carsten Lutz, Ulrike Sattler, Frank Wolter |
Modal Logic and the Two-Variable Fragment. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Yohji Akama |
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
partial combinatory algebra, limiting recursive functions, realizability interpretation, infinitary lambda-calculi, In the interpretation, ?-variables(=continuations) are interpreted as streams of -terms, calculus, discontinuity |
1 | Jean-Yves Girard 0001 |
Locus Solum: From the Rules of Logic to the Logic of Rules. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jan Van den Bussche |
Applications of Alfred Tarski's Ideas in Database Theory. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Keye Martin |
A Principle of Induction. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Marthedal Rasmussen |
Labelled Natural Deduction for Interval Logics. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Witold Charatonik, Jean-Marc Talbot |
The Decidability of Model Checking Mobile Ambients. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Marc Bezem |
An Improved Extensionality Criterion for Higher-Order Logic Programs. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jean Goubault-Larrecq |
Well-Founded Recursive Relations. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
well-foundedness, path orderings, Knuth-Bendix orderings, higher-order path orderings, graphs, automata, Termination, calculus |
1 | Vincent Danos, Russell Harmer |
The Anatomy of Innocence. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Robert F. Stärk, Stanislas Nanchen |
A Logic for Abstract State Machines. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
logical foundations of specification languages, modal logic, dynamic logic, Abstract State Machines |
1 | Edmund Robinson, Giuseppe Rosolini |
An Abstract Look at Realizability. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Naijun Zhan |
Completeness of Higher-Order Duration Calculus. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
duration calculus higher-order logic interval temporal logic completeness |
1 | Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl |
Equational Termination by Semantic Labelling. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Marc Pauly |
From Programs to Games: Invariance and Safety for Bisimulation. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Egon Börger, Joachim Schmid 0001 |
Composition and Submachine Concepts for Sequential ASMs. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Edith Hemaspaandra |
Modal Satisfiability Is in Deterministic Linear Space. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Thierry Coquand, Guo-Qiang Zhang 0001 |
Sequents, Frames, and Completeness. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Albert Atserias |
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
Circuit uniformity, BIT predicate, logarithmic-time hierarchy, rudimentary languages, integer division |
1 | Michel Parigot |
On the Computational Interpretation of Negation. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Julian C. Bradfield |
Independence: Logics and Concurrency. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Achim Blumensath |
Bounded Arithmetic and Descriptive Complexity. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
arithmetic, descriptive complexity, definability |
1 | Andrej Bauer, Lars Birkedal |
Continuous Functionals of Dependent Types and Equilogical Spaces. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
dependent type theory, equilogical spaces, domain theory, continuous functionals |
1 | Andreas Blass, Yuri Gurevich |
Background, Reserve, and Gandy Machines. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Johann A. Makowsky, Klaus Meer |
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Reinhard Kahle, Thomas Studer |
A Theory of Explicit Mathematics Equivalent to ID1. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
explicit mathematics, Proof theory, inductive definitions |
1 | Andrzej S. Murawski, C.-H. Luke Ong |
Discreet Games, Light Affine Logic and PTIME Computation. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
PTIME, Complexity, Linear Logic, Game Semantics |
1 | Saharon Shelah |
Choiceless Polynominal Time Logic: Inability to Express. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
Polynomial time logic, choiceless, games, Computer Science, Finite model theory |
1 | John Power, Edmund Robinson |
Logical Relations and Data Abstraction. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
cartesian closed fibrations, interpretations, lambda calculus, logical relations |
1 | Andreas Blass, Yuri Gurevich |
Choiceless Polynominal Time Computation and the Zero-One Law. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Roman Kuznets |
On the Complexity of Explicit Modal Logics. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Peter Clote, Helmut Schwichtenberg (eds.) |
Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Moshe Y. Vardi |
Automated Verification = Graphs, Automata, and Logic. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Danos, Jean-Louis Krivine |
Disjunctive Tautologies as Synchronisation Schemes. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Peter G. Hancock, Anton Setzer |
Interactive Programs in Dependent Type Theory. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
monadic I/O, repetition constructs, interaction, refinement, Functional programming, dependent types, reactive programming |
1 | David Aspinall 0001 |
Subtyping with Power Types. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
subtyping, type theory, dependent types |
1 | Zoltán Ésik |
Axiomatizing the Least Fixed Point Operation and Binary Supremum. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Colin Stirling |
Schema Revisited. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Mathieu Jaume |
Logic Programming and Co-inductive Definitions. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Samson Abramsky, Marina Lenisa |
A Fully Complete PER Model for ML Polymorphic Types. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
ML-polymorphic types, PER models, full completeness, linear logic, Geometry of Interaction |
1 | Wolfram Schulte |
Translating Theory into Practice - Abstract State Machines within Microsoft. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Alberto Momigliano |
Elimination of Negation in a Logical Framework. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Poizat |
Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Michael Benedikt, H. Jerome Keisler |
Definability over Linear Constraints. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | James Laird |
Finite Models and Full Completeness. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
affine logic, full completeness, effective presentability, linear logic, PCF |
1 | Matthias Baaz, Richard Zach |
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Peter Schuster |
Elementary Choiceless Constructive Analysis. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
Countable Choice, Unique Existence, Intermediate Values, Connectedness 2000 MSC. Primary 03F60, Secondary 03E25, 26A15, 26E40, 54D05, 54E35, Constructive Mathematics, Approximate Analysis |
1 | Rostislav E. Yavorsky |
On the Logic of the Standard Proof Predicate. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
logic of proofs, protocolling extensions of theories, semantics |
1 | Hubert Comon, Véronique Cortier |
Flatness Is Not a Weakness. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
Counter automata, model-checking, verification, temporal logics, logic in computer science |
1 | Victor Vianu |
Topological Queries in Spatial Databases. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Herman Geuvers, Erik Poll, Jan Zwanenburg |
Safe Proof Checking in Type Theory with Y. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Douglas J. Howe |
Interactive Theorem Proving Using Type Theory. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Marthedal Rasmussen |
Signed Interval Logic. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
temporal intervals, arrow logic, real-time systems, liveness, interval logic |
1 | Volker Diekert, Paul Gastin |
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
1 | Georg Gottlob, Etienne Grandjean, Katrin Seyr (eds.) |
Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Iain A. Stewart |
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Yoram Hirshfeld, Alexander Moshe Rabinovich |
Quantitative Temporal Logic. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jo Erskine Hannay |
Specification Refinement with System F. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Marina De Vos, Dirk Vermeir |
Choice Logic Programs and Nash Equilibria in Strategic Games. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
game theory, logic programs, nondeterminism, choice, stable model semantics |
1 | Peter D. Mosses |
Logical Specification of Operational Semantics. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Antonín Kucera 0001, Javier Esparza |
A Logical Viewpoint on Process-Algebraic Quotients. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Arts, Jürgen Giesl |
Applying Rewriting Techniques to the Verification of Erlang Processes. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Balat, Roberto Di Cosmo |
A Linear Logical View of Linear Type Isomorphisms. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Luca Roversi |
A P-Time Completeness Proof for Light Logics. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Tobies |
A NExpTime-Complete Description Logic Strictly Contained in C2. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jacobo Torán |
Lower Bounds for Space in Resolution. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Resolution, space, complexity measures, pebbling game |
1 | Eduardo Bonelli |
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Paul Gastin, Michael W. Mislove |
A Truly Concurrent Semantics for a Simple Parallel Programming Language. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard |
Difference Decision Diagrams. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Shigeki Hagihara, Naoki Yonezaki |
Resolution Method for Modal Logic with Well-Founded Frames. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Giorgio Delzanno, Javier Esparza, Andreas Podelski |
Constraint-Based Analysis of Broadcast Protocols. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | José L. Balcázar |
The Consistency Dimension, Compactness, and Query Learning. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Maribel Fernández, Ian Mackie |
Closed Reductions in the lambda-Calculus. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Aart Middeldorp |
Term Rewriting. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Clemens Lautemann, Bernhard Weinzinger |
MonadicNLIN and Quantifier-Free Reductions. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Lev D. Beklemishev |
Open Least Element Principle and Bounded Query Computation. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Leivant |
Applicative Control and Computational Complexity. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong |
A Universal Innocent Game Model for the Böhm Tree Lambda Theory. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Furio Honsell, Donald Sannella |
Pre-logical Relations. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Yonit Kesten, Amir Pnueli |
Verifying Liveness by Augmented Abstraction. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Erich Grädel, Stephan Kreutzer |
Descriptive Complexity Theory for Constraint Databases. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Helmut Seidl, Andreas Neumann 0001 |
On Guarding Nested Fixpoints. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Martin Fränzle |
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Thorsten Altenkirch, Bernhard Reus |
Monadic Presentations of Lambda Terms Using Generalized Inductive Types. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
inductive types, Type Theory, category theory, ?-calculus |