VSL 2014: VIENNA SUMMER OF LOGIC 2014
TALK KEYWORD INDEX

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

Shortcuts: 3ABCDEFHILMNPRSTUW
3
3-Variable Property
First-Order Logic of Order and Metric has the Three-Variable Property
A
ac0
Infinite AC0 Circuits for Parity
B
bit-vector
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
C
completeness
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
Composition Lemma
First-Order Logic of Order and Metric has the Three-Variable Property
conjunctive queries
Small Dynamic Descriptive Complexity Classes
constraint satisfaction problem
Descriptive Complexity and CSP
D
descriptive complexity
Descriptive Complexity and CSP
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
dynamic complexity
Small Dynamic Descriptive Complexity Classes
E
EF Games
First-Order Logic of Order and Metric has the Three-Variable Property
EXPSPACE
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
F
first order logic
First-Order Logic of Order and Metric has the Three-Variable Property
Fixpoint Logic
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
H
higher-order logic
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
I
implicit computational complexity
Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus
infinitary lambda-calculus
Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus
L
linear logic
Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus
lower bounds
Small Dynamic Descriptive Complexity Classes
M
majority polymorphism
Descriptive Complexity and CSP
modal logic
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
model checking
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
model theory
Infinite AC0 Circuits for Parity
N
non-uniform computation
Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus
P
PP
Towards recursion schemata for the probablistic class PP
probabilistic classes of computational complexity
Towards recursion schemata for the probablistic class PP
pseudofinite
Infinite AC0 Circuits for Parity
R
recursion schemata
Towards recursion schemata for the probablistic class PP
Refinement Modal Logic
Closing a Gap in the Complexity of Refinement Modal Logic
S
SAT
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
satisfiability
Closing a Gap in the Complexity of Refinement Modal Logic
SMT
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
T
Tableau
Closing a Gap in the Complexity of Refinement Modal Logic
U
Upper Complexity Bounds
Closing a Gap in the Complexity of Refinement Modal Logic
W
word-level model checking
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic