CSL18: COMPUTER SCIENCE LOGIC 2018

This page contains an index consisting of author-provided keywords.

A
Absoluteness	Safety, Absoluteness, and Computability
Action Lattices	Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
adhesive categories	Rule Algebras for Adhesive Categories
admissible strategies	Beyond admissibility: Dominance between chains of strategies
algebraic automata theory	An algebraic decision procedure for two-variable logic with a between relation
algebraic effects	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
alternating complexity	Climbing up the elementary complexity classes with theories of automatic structures
Automata with counters	Quantifying Bounds in Strategy Logic
automatic structures	Climbing up the elementary complexity classes with theories of automatic structures
B
bisimulation	Relating Structure and Power: Comonadic Semantics for Computational Resources
Böhm trees	Fully abstract models of the probabilistic lambda-calculus
C
call-by-need	Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing
call-by-push-value	Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing
cartesian bicategories	Graphical Conjunctive Queries
categorical logic	On compositionality of dinatural transformations
category theory	Graphical Conjunctive Queries
circuit characterization	Symmetric Circuits for Rank Logic
circuit framework	Symmetric Circuits for Rank Logic
circuits	Symmetric Circuits for Rank Logic
circular proofs	Local validity for circular proofs in linear logic with fixed points
coalgebras of a comonad	Relating Structure and Power: Comonadic Semantics for Computational Resources
cofinal	Beyond admissibility: Dominance between chains of strategies
coinduction	Local validity for circular proofs in linear logic with fixed points
coKleisli category	Relating Structure and Power: Comonadic Semantics for Computational Resources
combinatorial games	Relating Structure and Power: Comonadic Semantics for Computational Resources
comonads	Relating Structure and Power: Comonadic Semantics for Computational Resources
Completeness	Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
complexity	Canonical Models and the Complexity of Modal Team Logic
compositionality	On compositionality of dinatural transformations
Computability	Safety, Absoluteness, and Computability
Computational Type Theory	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
computer-checked proofs	High-level arities and initial semantics
concurrency	Rule Algebras for Adhesive Categories
Concurrent games	The True Concurrency of Herbrand's Theorem
conjunctive queries	Graphical Conjunctive Queries
Constraint satisfaction	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
contextual equivalence	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
Contextual Modal Logic	A Contextual Reconstruction of Monadic Reflection
control	Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing
Controller Synthesis	Synthesizing Optimally Resilient Controllers
Cubical Sets	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
Curry-Howard Isomorphism	A Contextual Reconstruction of Monadic Reflection
cut elimination	MacNeille completion and Buchholz' Omega rule for parameter-free second order logics Non-wellfounded proof theory for (Kleene+action)(algebras+lattices) An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
Cyclic Proof	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Cyclic proofs	Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
D
database theory	Graphical Conjunctive Queries
decidability	A Decidable Fragment of Second Order Logic With Applications to Synthesis Safety, Absoluteness, and Computability
Delimited Continuations	A Contextual Reconstruction of Monadic Reflection
denotational semantics	A Fully Abstract Game Semantics for Countable Nondeterminism
Dependent Safety	Safety, Absoluteness, and Computability
descriptive complexity	Definable Inapproximability: New Challenges for Duplicator Symmetric Circuits for Rank Logic
differential linear logic	An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
dinatural transformation	On compositionality of dinatural transformations
Disturbances	Synthesizing Optimally Resilient Controllers
Domain Independence	Safety, Absoluteness, and Computability
domain theory	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
dominated strategies	Beyond admissibility: Dominance between chains of strategies
double pushout (DPO) rewriting	Rule Algebras for Adhesive Categories
Dynamical systems	Finite bisimulations for dynamical systems with overlapping trajectories
E
Ehrenfeucht-Fraisse games	Relating Structure and Power: Comonadic Semantics for Computational Resources
Enriched Category	Quantitative Foundations for Resource Theories
Existential second-order logic	Dependency Concepts up to Equivalence
Expressive power	Expressivity within second-order transitive-closure logic
F
Finite bisimulations	Finite bisimulations for dynamical systems with overlapping trajectories
finite model theory	An algebraic decision procedure for two-variable logic with a between relation Expressivity within second-order transitive-closure logic Definable Inapproximability: New Challenges for Duplicator Relating Structure and Power: Comonadic Semantics for Computational Resources Symmetric Circuits for Rank Logic
finitization	Local validity for circular proofs in linear logic with fixed points
first-order theory	Climbing up the elementary complexity classes with theories of automatic structures
fixed points	Local validity for circular proofs in linear logic with fixed points
fixed-point logic with counting	Definable Inapproximability: New Challenges for Duplicator
fixed-point logic with rank	Symmetric Circuits for Rank Logic
forest of trees of bounded height	Climbing up the elementary complexity classes with theories of automatic structures
full abstraction	A Fully Abstract Game Semantics for Countable Nondeterminism
Function algebras	A recursion-theoretic characterisation of the positive polynomial-time functions
Function classes	A recursion-theoretic characterisation of the positive polynomial-time functions
G
game semantics	A Fully Abstract Game Semantics for Countable Nondeterminism The True Concurrency of Herbrand's Theorem Fully abstract models of the probabilistic lambda-calculus
games and logic	A Fully Abstract Game Semantics for Countable Nondeterminism
games played on finite graphs	Beyond admissibility: Dominance between chains of strategies
H
Henkin Semantics	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Herbrand's theorem	The True Concurrency of Herbrand's Theorem
Homotopy Type Theory	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
I
Implicit complexity	A recursion-theoretic characterisation of the positive polynomial-time functions
Implicit Computational Complexity	Combining Linear Logic and Size Types for Implicit Complexity
inapproximability	Definable Inapproximability: New Challenges for Duplicator
induction	Local validity for circular proofs in linear logic with fixed points
Inductive Reasoning	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Infinitary Proof Systems	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
infinite descent	Local validity for circular proofs in linear logic with fixed points Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Infinite Games	Parity Games with Weights Synthesizing Optimally Resilient Controllers
initial algebra semantics	High-level arities and initial semantics
Intersecting trajectories	Finite bisimulations for dynamical systems with overlapping trajectories
K
Kleene algebra	Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
L
lambda-calculus	Fully abstract models of the probabilistic lambda-calculus Combining Linear Logic and Size Types for Implicit Complexity
linear logic	Local validity for circular proofs in linear logic with fixed points An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets Combining Linear Logic and Size Types for Implicit Complexity
Logic	A Decidable Fragment of Second Order Logic With Applications to Synthesis A recursion-theoretic characterisation of the positive polynomial-time functions
logical equivalences	Relating Structure and Power: Comonadic Semantics for Computational Resources
Logics of dependence and independence	Dependency Concepts up to Equivalence
M
MacNeille completion	MacNeille completion and Buchholz' Omega rule for parameter-free second order logics
Markov decision process	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
Memory Requirements	Parity Games with Weights
modal logic	Canonical Models and the Complexity of Modal Team Logic
Model checking	Quantifying Bounds in Strategy Logic
Model Theory	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Monadic Reflection	A Contextual Reconstruction of Monadic Reflection
Monadic second-order logic	Expressivity within second-order transitive-closure logic
monadic substitution	High-level arities and initial semantics
Monotone complexity	A recursion-theoretic characterisation of the positive polynomial-time functions
multi sorted	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Multicategory	Quantitative Foundations for Resource Theories
muMALL	Local validity for circular proofs in linear logic with fixed points
N
non-wellfounded proofs	Local validity for circular proofs in linear logic with fixed points
nondeterminism	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
O
O-minimal structures	Finite bisimulations for dynamical systems with overlapping trajectories
Omega rule	MacNeille completion and Buchholz' Omega rule for parameter-free second order logics
operational semantics	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
Optimisation	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
order theory	Beyond admissibility: Dominance between chains of strategies
P
Parity Games	Parity Games with Weights
pebble games	Definable Inapproximability: New Challenges for Duplicator Relating Structure and Power: Comonadic Semantics for Computational Resources
Piecewise linear functions	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
polarity	Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing
Polynomial Ambiguity	Approximating Probabilistic Automata
Polynomial Time Complexity	Combining Linear Logic and Size Types for Implicit Complexity
Positive complexity	A recursion-theoretic characterisation of the positive polynomial-time functions
Probabilistic Automata	Approximating Probabilistic Automata
probabilistic choice	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
probability	Fully abstract models of the probabilistic lambda-calculus
program synthesis	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Prompt LTL	Quantifying Bounds in Strategy Logic
proof nets	An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
proof-search	Local validity for circular proofs in linear logic with fixed points
Q
quantified fragment	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Quantitative Foundations	Quantitative Foundations for Resource Theories
Quantitative Games	Parity Games with Weights
query inclusion	Graphical Conjunctive Queries
R
reachability games	Beyond admissibility: Dominance between chains of strategies
Reachability properties	Finite bisimulations for dynamical systems with overlapping trajectories
reactive synthesis	Beyond admissibility: Dominance between chains of strategies
Recursion-theoretic characterisations	A recursion-theoretic characterisation of the positive polynomial-time functions
recursive programs	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Regular Languages	Approximating Probabilistic Automata
relational model	Fully abstract models of the probabilistic lambda-calculus
Resilient Strategies	Synthesizing Optimally Resilient Controllers
Resource Theory	Quantitative Foundations for Resource Theories
rule algebras	Rule Algebras for Adhesive Categories
S
safety games	Beyond admissibility: Dominance between chains of strategies
satisfiability	Definable Inapproximability: New Challenges for Duplicator Canonical Models and the Complexity of Modal Team Logic
second order	A Decidable Fragment of Second Order Logic With Applications to Synthesis
second order logic	MacNeille completion and Buchholz' Omega rule for parameter-free second order logics
Second-order transitive-closure logic	Expressivity within second-order transitive-closure logic
Semilinear	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Sequent Calculus	Local validity for circular proofs in linear logic with fixed points Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
shift/reset	A Contextual Reconstruction of Monadic Reflection
signatures	High-level arities and initial semantics
Size Types	Combining Linear Logic and Size Types for Implicit Complexity
stochastic mechanics	Rule Algebras for Adhesive Categories
Strategy Logic	Quantifying Bounds in Strategy Logic
Strategy Synthesis	Parity Games with Weights
string diagrams	Graphical Conjunctive Queries
Submodular functions	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
symmetric circuits	Symmetric Circuits for Rank Logic
syntax	High-level arities and initial semantics
T
team semantics	Dependency Concepts up to Equivalence Canonical Models and the Complexity of Modal Team Logic
Transitive Closure Logic	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
True concurrency	The True Concurrency of Herbrand's Theorem
Two-Level Type Theory	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
two-variable logic	An algebraic decision procedure for two-variable logic with a between relation
Type Systems	Combining Linear Logic and Size Types for Implicit Complexity
U
unbounded nondeterminism	A Fully Abstract Game Semantics for Countable Nondeterminism
uniform families of circuits	Symmetric Circuits for Rank Logic
V
Valued constraint satisfaction problems	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Verification	Quantifying Bounds in Strategy Logic
vertex cover	Definable Inapproximability: New Challenges for Duplicator

Disclaimer | Powered by EasyChair Smart Program