CSL 2017: 26TH EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC

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

\
\omega-regular languages	Query Learning of Derived Omega-Tree Languages in Polynomial Time
A
abstract separation logics	Decidable Logics with associative binary modalities
Ackermann fragment	On Implicit Dependence and Independence between Differently Quantified First-Order Variables
aleph_1	aleph_1 and the modal mu-calculus
Algebraic complexity	Arithmetic Circuits: An Overview
Algorithmic Metatheorems	On Supergraphs Satisfying CMSO Properties
Algorithmic Model Theory	Advice Automatic Structures and Uniformly Automatic Classes
alphabetic topology	Polishness of some topologies related to automata
alternation hierarchy	The modal mu-calculus and the descriptive complexity of parity games
auditing	Strongly Normalizing Audited Computation
automata	CALF: Categorical Automata Learning Framework Symbolic automata theory with applications (extended abstract)
Automata and formal languages	Polishness of some topologies related to automata
automata learning	Query Learning of Derived Omega-Tree Languages in Polynomial Time
Automata theory	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
Automatic Structures	Advice Automatic Structures and Uniformly Automatic Classes
Automatic synthesis	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
automatic topology	Polishness of some topologies related to automata
B
B\"uchi automaton	Polishness of some topologies related to automata
B\"uchi topology	Polishness of some topologies related to automata
Bernays-Schönfinkel fragment	On Implicit Dependence and Independence between Differently Quantified First-Order Variables
beta-reduction	Taylor expansion, β-reduction and normalization
BHK-interpretation	Game Semantics for Martin-Löf Type Theory
Bidimensionality	On Supergraphs Satisfying CMSO Properties
Boolean valued model	On Takeuti-Yasumoto forcing
bounded arithmetic	On Takeuti-Yasumoto forcing
Branching programs	Arithmetic Circuits: An Overview
buchi automata	Query Learning of Derived Omega-Tree Languages in Polynomial Time
C
Calculus Categories	Integral Categories and Calculus Categories
Call-by-need	The Dynamic Geometry of Interaction Machine
Cantor space	Polishness of some topologies related to automata
categorical semantics	Categorical structures for type theory in univalent foundations
Categories of models for concurrency	Strategies with Parallel Causes
categories with families	Categorical structures for type theory in univalent foundations
category theory	CALF: Categorical Automata Learning Framework
chordal claw-free graphs	Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
circuit depth	Slicewise definability in first-order logic with bounded quantifier rank
Circuits	Arithmetic Circuits: An Overview
closure ordinal	aleph_1 and the modal mu-calculus
CMSO logic	On Supergraphs Satisfying CMSO Properties
cographs	A Finitary Analogue of the Downward Löwenheim-Skolem Property
compactness	Noetherian Quasi-Polish spaces
complexity of satisfiability	Extending Two-Variable Logic on Trees
composition lemma	A Finitary Analogue of the Downward Löwenheim-Skolem Property
Compositionality	Precongruence Formats with Lookahead through Modal Decomposition
computability	Partial Elements and Recursion via Dominances in Univalent Type Theory
computational complexity	Validity and Entailment in Modal and Propositional Dependence Logics
Congruence	Precongruence Formats with Lookahead through Modal Decomposition
constraint satisfaction	The Quantum Monad on Relational Structures
Constraint solving	First-Order Interpolation and Grey Areas of Proofs
constructive mathematics	Partial Elements and Recursion via Dominances in Univalent Type Theory
contextuality	The Quantum Monad on Relational Structures
continuous function	aleph_1 and the modal mu-calculus
Cost model	The Dynamic Geometry of Interaction Machine
counting	Weaker counting abilities in first-order logic
D
Data exchange	Schema mappings: Structural Properties and Limits
deep inference	Removing Cycles from Proofs
denotational semantics	Taylor expansion, β-reduction and normalization
dependence logic	Filtration versus Team Semantics Validity and Entailment in Modal and Propositional Dependence Logics
dependent types	Game Semantics for Martin-Löf Type Theory
derived languages	Query Learning of Derived Omega-Tree Languages in Polynomial Time
descriptive and computational complexity	On the First-Order Complexity of Induced Subgraph Isomorphism
descriptive complexity	Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs The modal mu-calculus and the descriptive complexity of parity games Stone duality and the substitution principle
Descriptive set theory	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
Determinant	Arithmetic Circuits: An Overview
Differential Categories	Integral Categories and Calculus Categories
digital circuits	Diagrammatic Semantics for Digital Circuits
Distributed games	Strategies with Parallel Causes
dominance	Partial Elements and Recursion via Dominances in Univalent Type Theory
downward L\"owenheim-Skolem theorem	A Finitary Analogue of the Downward Löwenheim-Skolem Property
Duality	Stone duality and the substitution principle
E
entailment	Validity and Entailment in Modal and Propositional Dependence Logics
Event structures	Strategies with Parallel Causes
expressivity	Extending Two-Variable Logic on Trees
F
f.p.t	A Finitary Analogue of the Downward Löwenheim-Skolem Property
finer topologies	Polishness of some topologies related to automata
finite model theory	The Model-Theoretic Expressiveness of Propositional Proof Systems Filtration versus Team Semantics
finite-variable first-order logic	On the First-Order Complexity of Induced Subgraph Isomorphism
First-order logic	Slicewise definability in first-order logic with bounded quantifier rank Weaker counting abilities in first-order logic
Fixed point	Inductive and Functional Types in Ludics
Fixed-point logics	The Model-Theoretic Expressiveness of Propositional Proof Systems
focused proofs	Separating Functional Computation from Relations
formalization	Categorical structures for type theory in univalent foundations
Formulas	Arithmetic Circuits: An Overview
functions and relations	Separating Functional Computation from Relations
G
game semantics	Game Semantics for Martin-Löf Type Theory Inductive and Functional Types in Ludics
Geiger's Theorem	An Algebraic Approach to Valued Constraint Satisfaction
generalized connectives	Non decomposable connectives of linear logic
generalized quantifiers	The Model-Theoretic Expressiveness of Propositional Proof Systems
Geometry of Interaction	The Dynamic Geometry of Interaction Machine
good for games	Query Learning of Derived Omega-Tree Languages in Polynomial Time
good for tress	Query Learning of Derived Omega-Tree Languages in Polynomial Time
graded monads	The Quantum Monad on Relational Structures
grammatical inference	Query Learning of Derived Omega-Tree Languages in Polynomial Time
Graph Completion	On Supergraphs Satisfying CMSO Properties
graph games	Improved Set-based Symbolic Algorithms for Parity Games
graph rewriting	Diagrammatic Semantics for Digital Circuits
H
Henkin quantifiers	On Implicit Dependence and Independence between Differently Quantified First-Order Variables
homotopy type theory	Partial Elements and Recursion via Dominances in Univalent Type Theory
Horn fragments	Fast(er) Reasoning in Interval Temporal Logic
I
index problem	The modal mu-calculus and the descriptive complexity of parity games
Inductive types	Inductive and Functional Types in Ludics
Infinite alphabets	Symbolic automata theory with applications (extended abstract)
Infinite games	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
Infinite words	On the (In)Succinctness of Muller Automata Polishness of some topologies related to automata
Integral Categories	Integral Categories and Calculus Categories
Interpolation	First-Order Interpolation and Grey Areas of Proofs
Interval Logic	Fast(er) Reasoning in Interval Temporal Logic
intuitionistic logic	A decidable intuitionistic temporal logic
J
Justification Logic	Interpreting the plus sign in justification logic as the union of sets of justifications (Extended Abstract) Strongly Normalizing Audited Computation
L
lambda-calculus	Taylor expansion, β-reduction and normalization
learning	CALF: Categorical Automata Learning Framework
linear logic	Taylor expansion, β-reduction and normalization Non decomposable connectives of linear logic Inductive and Functional Types in Ludics
logarithmic space	Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
Logic	Advice Automatic Structures and Uniformly Automatic Classes
Logic and databases	Schema mappings: Structural Properties and Limits
logic in computer science	Polishness of some topologies related to automata
Logic of Proofs	Interpreting the plus sign in justification logic as the union of sets of justifications (Extended Abstract)
Logic on Words	Stone duality and the substitution principle
logical fractal	A Finitary Analogue of the Downward Löwenheim-Skolem Property
Lookahead	Precongruence Formats with Lookahead through Modal Decomposition
Ludics	Inductive and Functional Types in Ludics
M
Martin-L\"of type theory	Game Semantics for Martin-Löf Type Theory
Metric spaces	Schema mappings: Structural Properties and Limits
modal $\mu$ calculus	The modal mu-calculus and the descriptive complexity of parity games
Modal Decomposition	Precongruence Formats with Lookahead through Modal Decomposition
modal logic	Precongruence Formats with Lookahead through Modal Decomposition Filtration versus Team Semantics Interpreting the plus sign in justification logic as the union of sets of justifications (Extended Abstract) Validity and Entailment in Modal and Propositional Dependence Logics
modal logics	Decidable Logics with associative binary modalities
modal mu-calculus	aleph_1 and the modal mu-calculus
model checking	Improved Set-based Symbolic Algorithms for Parity Games Modal mu-calculus with atoms
model learning	Query Learning of Derived Omega-Tree Languages in Polynomial Time
monadic first-order fragment	On Implicit Dependence and Independence between Differently Quantified First-Order Variables
monoidal categories	Diagrammatic Semantics for Digital Circuits
mu-calculus	Modal mu-calculus with atoms
Muller automata	On the (In)Succinctness of Muller Automata
N
nested words	A Finitary Analogue of the Downward Löwenheim-Skolem Property
Noetherian space	Noetherian Quasi-Polish spaces
non-determinism	Taylor expansion, β-reduction and normalization
non-local games	The Quantum Monad on Relational Structures
normalization	Taylor expansion, β-reduction and normalization
O
Omega automata	On the (In)Succinctness of Muller Automata
Omega languages	On the (In)Succinctness of Muller Automata
omega_1	aleph_1 and the modal mu-calculus
P
P=NP problem	On Takeuti-Yasumoto forcing
Parallel causes	Strategies with Parallel Causes
parameterized AC^0	Slicewise definability in first-order logic with bounded quantifier rank
parity games	Improved Set-based Symbolic Algorithms for Parity Games The modal mu-calculus and the descriptive complexity of parity games
partial function	Partial Elements and Recursion via Dominances in Univalent Type Theory
Permanent	Arithmetic Circuits: An Overview
Polish topology	Polishness of some topologies related to automata
polymorphism	An Algebraic Approach to Valued Constraint Satisfaction
polynomial calculus	The Model-Theoretic Expressiveness of Propositional Proof Systems
polynomial learnability	Query Learning of Derived Omega-Tree Languages in Polynomial Time
polynomial time	Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
pp-definability	An Algebraic Approach to Valued Constraint Satisfaction
Probability	Strategies with Parallel Causes
products of modal logics	A decidable intuitionistic temporal logic
Program analysis	First-Order Interpolation and Grey Areas of Proofs
progress measure	Improved Set-based Symbolic Algorithms for Parity Games
proof complexity	Removing Cycles from Proofs
proof nets	Non decomposable connectives of linear logic
proof theory	Removing Cycles from Proofs
Proof transformations	First-Order Interpolation and Grey Areas of Proofs
propositional logic	Validity and Entailment in Modal and Propositional Dependence Logics
Propositional proof systems	The Model-Theoretic Expressiveness of Propositional Proof Systems
Q
quantifier depth and variable width	On the First-Order Complexity of Induced Subgraph Isomorphism
quantifier rank	Slicewise definability in first-order logic with bounded quantifier rank
quantum computation	The Quantum Monad on Relational Structures
quantum homomorphisms	The Quantum Monad on Relational Structures
R
realizability	Game Semantics for Martin-Löf Type Theory
Realization Theorem	Interpreting the plus sign in justification logic as the union of sets of justifications (Extended Abstract)
recursion theory	Partial Elements and Recursion via Dominances in Univalent Type Theory
regular $\omega$-language	Polishness of some topologies related to automata
regular cardinal	aleph_1 and the modal mu-calculus
resolution	The Model-Theoretic Expressiveness of Propositional Proof Systems
S
Satisfiability	Fast(er) Reasoning in Interval Temporal Logic
Schema mappings	Schema mappings: Structural Properties and Limits
sequent calculus	Non decomposable connectives of linear logic
sets with atoms	Modal mu-calculus with atoms
singleton sets	Separating Functional Computation from Relations
Skolemization of first-order variables	On Implicit Dependence and Independence between Differently Quantified First-Order Variables
Strategies	Strategies with Parallel Causes
strong alphabetic topology	Polishness of some topologies related to automata
strong normalization	Strongly Normalizing Audited Computation
Structural Operational Semantics	Precongruence Formats with Lookahead through Modal Decomposition
substructural logics	Decidable Logics with associative binary modalities
sum of ordinals	aleph_1 and the modal mu-calculus
symbolic computation	Improved Set-based Symbolic Algorithms for Parity Games
synthetic descriptive set theory	Noetherian Quasi-Polish spaces
synthetic topology	Noetherian Quasi-Polish spaces
T
team logic	Filtration versus Team Semantics
team semantics	Decidable Logics with associative binary modalities
temporal logic	A decidable intuitionistic temporal logic
term representation	Separating Functional Computation from Relations
the induced subgraph isomorphism problem	On the First-Order Complexity of Induced Subgraph Isomorphism
Theorem proving	First-Order Interpolation and Grey Areas of Proofs
Tractability	Fast(er) Reasoning in Interval Temporal Logic
Transducers	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach Symbolic automata theory with applications (extended abstract)
translation schemes	A Finitary Analogue of the Downward Löwenheim-Skolem Property
tree languages	Query Learning of Derived Omega-Tree Languages in Polynomial Time
tree representation	A Finitary Analogue of the Downward Löwenheim-Skolem Property
tree-depth	A Finitary Analogue of the Downward Löwenheim-Skolem Property
trees	Extending Two-Variable Logic on Trees A Finitary Analogue of the Downward Löwenheim-Skolem Property
two-variable logic	Extending Two-Variable Logic on Trees
type categories	Categorical structures for type theory in univalent foundations
U
univalent type theory	Partial Elements and Recursion via Dominances in Univalent Type Theory Categorical structures for type theory in univalent foundations
V
validity	Validity and Entailment in Modal and Propositional Dependence Logics
Valued constraint satisfaction problem	An Algebraic Approach to Valued Constraint Satisfaction
W
weak formalisms	Weaker counting abilities in first-order logic
weak parity automata	Query Learning of Derived Omega-Tree Languages in Polynomial Time
weak regular \omega-languages	Query Learning of Derived Omega-Tree Languages in Polynomial Time

Disclaimer | Powered by EasyChair Smart Program