FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

0
0-1 laws	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
A
Abstract machines	Reasonable Space for the Lambda-Calculus, Logarithmically
active learning	Active learning for sound negotiations
Algebraic Circuits	Identity testing for radical expressions
Algebraic Geometry	A functorial excursion between algebraic geometry and linear logic
alphabetic equivalence	Size measures and alphabetic equivalence in the mu-calculus
Angluin algorithm	Active learning for sound negotiations
arithmetic	Geometric decision procedures and the VC dimension of linear arithmetic theories
Asynchronicity	Temporal Team Semantics Revisited
Automata	Reasoning on Data Words over Numeric Domains Size measures and alphabetic equivalence in the mu-calculus
automata theory	The Regular Languages of First-Order Logic with One Alternation Temporal Team Semantics Revisited
automatic structures	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
B
Bar Recursion	A direct computational interpretation of second-order arithmetic via update recursion
Behavioural equivalence	Graded Monads and Behavioural Equivalence Games
bidirected	The complexity of bidirected reachability in valence systems
bisimilarity	Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
Boolean algebra	A first-order completeness result about characteristic Boolean algebras in classical realizability
bounded expansion	Treelike decompositions for transductions of sparse graphs
bounded-depth Frege	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
boundedness problem	The boundedness and zero isolation problems for weighted automata over nonnegative rationals
C
canonization	Choiceless Polynomial Time with Witnessed Symmetric Choice
categorical semantics	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings Normalization for Multimodal Type Theory
Category	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
category theory	The Pebble-Relation Comonad in Finite Model Theory
characterization	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
chi-boundedness	Stable graphs of bounded twin-width
Choiceless Polynomial Time	Choiceless Polynomial Time with Witnessed Symmetric Choice
circuit complexity	Complexity of Modular Circuits
circuit satisfiability	Complexity of Modular Circuits
Circular proofs	Bouncing threads for circular and non-wellfounded proofs
classical realizability	A first-order completeness result about characteristic Boolean algebras in classical realizability
clique-width	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
coalgebra	Graded Monads and Behavioural Equivalence Games Monoidal Streams for Dataflow Programming
coherence	Syllepsis in Homotopy Type Theory
Coinduction	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
complete proof system	Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
complexity	Stochastic Games with Synchronizing Objectives Reasoning on Data Words over Numeric Domains The complexity of bidirected reachability in valence systems The complexity of soundness in workflow nets Size measures and alphabetic equivalence in the mu-calculus
complexity analysis	Quantum Expectation Transformers for Cost Analysis
Computable analysis	Computable PAC Learning of Continuous Features
computational complexity	Identity testing for radical expressions
computer-checked proofs	Semantics for two-dimensional type theory
computing termination probability	Probabilistic Verification Beyond Context-Freeness
Concrete sheaves	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
Context-free languages	On the Satisfiability of Context-free String Constraints with Subword Ordering
convex polyhedra	Geometric decision procedures and the VC dimension of linear arithmetic theories
copy-discard categories	Probability monads with submonads of deterministic states
Cost models	Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic Reasonable Space for the Lambda-Calculus, Logarithmically
countably basic monad	Varieties of quantitative algebras and their monads
Cubical Type Theory	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Curry-Howard	A first-order completeness result about characteristic Boolean algebras in classical realizability
Curry-Howard correspondence	Bouncing threads for circular and non-wellfounded proofs Curry and Howard Meet Borel
Cut Elimination	Bouncing threads for circular and non-wellfounded proofs
Cyclic proofs	Cyclic Implicit Complexity
D
data words	Reasoning on Data Words over Numeric Domains
dataflow programming	Monoidal Streams for Dataflow Programming
decidability	Bouncing threads for circular and non-wellfounded proofs The complexity of bidirected reachability in valence systems On the Skolem Problem and the Skolem Conjecture
deciding almost sure termination	Probabilistic Verification Beyond Context-Freeness
Denotational semantics	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks Probability monads with submonads of deterministic states
density	Computing the Density of the Positivity Set for Linear Recurrence Sequences
dependent right adjoints	Normalization for Multimodal Type Theory
Descriptive Complexity	The Regular Languages of First-Order Logic with One Alternation Separating LREC from LFP
deterministic hierarchies	The amazing mixed polynomial closure and its applications to two-variable first-order logic
dichotomy theorem	Smooth approximations and CSPs over finitely bounded homogeneous structures
distributed automata	Active learning for sound negotiations
Domains	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
dot-depth hierarchy	The Regular Languages of First-Order Logic with One Alternation
E
Eckmann-Hilton	Syllepsis in Homotopy Type Theory
element-free probabilities	Partitions and Ewens Distributions in element-free Probability Theory
enriched monad	Varieties of quantitative algebras and their monads
equational logic	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
evaluation	Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Ewens distribution	Partitions and Ewens Distributions in element-free Probability Theory
expectation transformer	Quantum Expectation Transformers for Cost Analysis
Expected runtime	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
explicit substitutions	Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
Exponential local-global principle	On the Skolem Problem and the Skolem Conjecture
F
feedback	Monoidal Streams for Dataflow Programming
finite abstraction	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Finite Model Theory	Separating LREC from LFP When Locality Meets Preservation Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics The Pebble-Relation Comonad in Finite Model Theory
finitely basic monad	Varieties of quantitative algebras and their monads
first-order logic	The Regular Languages of First-Order Logic with One Alternation Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
first-order theory of the reals	Probabilistic Verification Beyond Context-Freeness
fixed points	Bouncing threads for circular and non-wellfounded proofs
Fixed-Point Logic	Separating LREC from LFP
formal semantics	Quantum Expectation Transformers for Cost Analysis
free algebras	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Function algebras	Cyclic Implicit Complexity
Functor of points	A functorial excursion between algebraic geometry and linear logic
G
Gaifman Normal Form	When Locality Meets Preservation
game comonads	The Pebble-Relation Comonad in Finite Model Theory
games	Graded Monads and Behavioural Equivalence Games
games on graphs	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
generalised soundness	The complexity of soundness in workflow nets
gluing	Normalization for Multimodal Type Theory
graded modalities	Logical Foundations of Quantitative Equality
Graded monads	Graded Monads and Behavioural Equivalence Games
graphical calculus	Zigzag normalisation for associative n-categories
Guarded Recursion	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
H
higher categories	Zigzag normalisation for associative n-categories
higher category theory	A Type Theory for Strictly Unital Infinity-Categories Syllepsis in Homotopy Type Theory
Higher Inductive Types	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Higher order computation	Cyclic Implicit Complexity
higher-order	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
homotopy	Zigzag normalisation for associative n-categories
homotopy type theory	A Type Theory for Strictly Unital Infinity-Categories Syllepsis in Homotopy Type Theory
hyperdoctrine	Logical Foundations of Quantitative Equality
HyperLTL	Deciding Hyperproperties Combined with Functional Specifications
Hyperproperties	Deciding Hyperproperties Combined with Functional Specifications Temporal Team Semantics Revisited
I
Implicit Complexity	Cyclic Implicit Complexity
Independent Hashing	On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
Induction and coinduction	Bouncing threads for circular and non-wellfounded proofs
infinite duration	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
infinite-domain constraint satisfaction problem	Smooth approximations and CSPs over finitely bounded homogeneous structures
infinite-state systems	The complexity of bidirected reachability in valence systems
Interpretation	Stable graphs of bounded twin-width
interpretations	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
isolation problem	The boundedness and zero isolation problems for weighted automata over nonnegative rationals
isomorphism	Choiceless Polynomial Time with Witnessed Symmetric Choice
L
Lafont category	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
lambda calculus	Reasonable Space for the Lambda-Calculus, Logarithmically Curry and Howard Meet Borel
lambda-calculus	Resource approximation for the lambda-mu-calculus
lambda-mu-calculus	Resource approximation for the lambda-mu-calculus
linear equations	Solvability of orbit-finite systems of linear equations
Linear Integer Arithmetic	Geometric decision procedures and the VC dimension of linear arithmetic theories
linear logic	A functorial excursion between algebraic geometry and linear logic Bouncing threads for circular and non-wellfounded proofs Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic Resource approximation for the lambda-mu-calculus Logical Foundations of Quantitative Equality
linear loops	Computing the Density of the Positivity Set for Linear Recurrence Sequences
linear real	Geometric decision procedures and the VC dimension of linear arithmetic theories
Linear recurrence sequences	Computing the Density of the Positivity Set for Linear Recurrence Sequences
Linear-time/branching-time spectrum	Graded Monads and Behavioural Equivalence Games
Liveness	Deciding Hyperproperties Combined with Functional Specifications
local consistency	Smooth approximations and CSPs over finitely bounded homogeneous structures
local-time semantics	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Locality	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth When Locality Meets Preservation
locally presentable category	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
Logarithmic Space	Separating LREC from LFP
Logic	Separating LREC from LFP
logic for PTime	Choiceless Polynomial Time with Witnessed Symmetric Choice
logical relations	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
Lossy channel systems	On the Satisfiability of Context-free String Constraints with Subword Ordering
lower bounds	Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
LREC	Separating LREC from LFP
M
Markov categories	Probability monads with submonads of deterministic states
membership	The amazing mixed polynomial closure and its applications to two-variable first-order logic
metrics	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
modal mu-calculus	Size measures and alphabetic equivalence in the mu-calculus
modal type theory	Normalization for Multimodal Type Theory
modalities	Normalization for Multimodal Type Theory
model checking	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth Temporal Team Semantics Revisited Size measures and alphabetic equivalence in the mu-calculus
model counting	On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
modular circuits	Complexity of Modular Circuits
monadic decomposability	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
monadic dependence	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
monadic stability	Stable graphs of bounded twin-width
monads	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning Probability monads with submonads of deterministic states
monoidal category	Monoidal Streams for Dataflow Programming
monoidal stream	Monoidal Streams for Dataflow Programming
Mu-Calculus	Bouncing threads for circular and non-wellfounded proofs
multinomial theorem	Partitions and Ewens Distributions in element-free Probability Theory
multiset	Partitions and Ewens Distributions in element-free Probability Theory
mutation	Partitions and Ewens Distributions in element-free Probability Theory
N
negotiations	Active learning for sound negotiations
Nondeterminism	A first-order completeness result about characteristic Boolean algebras in classical realizability
normalization	Normalization for Multimodal Type Theory
nowhere dense	Treelike decompositions for transductions of sparse graphs
Nullstellensatz	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
Number Fields	Identity testing for radical expressions
O
orbit-finite sets	Solvability of orbit-finite systems of linear equations
P
PAC learning	Computable PAC Learning of Continuous Features
parser	Efficient Construction of Reversible Transducers from Regular Transducer Expressions
partial Horn theory	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
partial-order methods	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
partition	Partitions and Ewens Distributions in element-free Probability Theory
path induction	Syllepsis in Homotopy Type Theory
pathwidth	The Pebble-Relation Comonad in Finite Model Theory
pebble-relation	The Pebble-Relation Comonad in Finite Model Theory
petri nets	Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes The complexity of soundness in workflow nets
Physical observable	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Pigeonhole principle	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
polymorphism	A direct computational interpretation of second-order arithmetic via update recursion Smooth approximations and CSPs over finitely bounded homogeneous structures
polynomial closure	The amazing mixed polynomial closure and its applications to two-variable first-order logic
Polynomial Identity Testing	Identity testing for radical expressions
positionality	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
positivity	Computing the Density of the Positivity Set for Linear Recurrence Sequences
Presburger	Reasoning on Data Words over Numeric Domains
Presburger arithmetic	Geometric decision procedures and the VC dimension of linear arithmetic theories
Preservation theorem	When Locality Meets Preservation
Presheaf Models of Type Theory	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
probabilistic (affine additive) higher-order recursion schemes	Probabilistic Verification Beyond Context-Freeness
probabilistic programming	Curry and Howard Meet Borel Probability monads with submonads of deterministic states
probability	Probability monads with submonads of deterministic states
probability distribution	Partitions and Ewens Distributions in element-free Probability Theory
probability distributions	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
process algebra	Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
process graphs	Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
productivity	Bouncing threads for circular and non-wellfounded proofs
proof nets	Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
proof-as-program	A first-order completeness result about characteristic Boolean algebras in classical realizability
pushdown	The complexity of bidirected reachability in valence systems
Q
quantifier alternation	The amazing mixed polynomial closure and its applications to two-variable first-order logic
quantitative algebra	Varieties of quantitative algebras and their monads
quantitative reasoning	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning Logical Foundations of Quantitative Equality
quantitative/qualitative verification of omega-regular properties	Probabilistic Verification Beyond Context-Freeness
quantum programming	Quantum Expectation Transformers for Cost Analysis Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Quantum random walk	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Quantum weakest precondition	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
R
Ramsey quantifier	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
random interpretations	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
Randomised Algorithms	Identity testing for radical expressions
randomized computation	Curry and Howard Meet Borel
reachability	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
reachability problem	Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes The complexity of bidirected reachability in valence systems
Realizability	A direct computational interpretation of second-order arithmetic via update recursion A first-order completeness result about characteristic Boolean algebras in classical realizability
recurrent reachability	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Recursion	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
Regular expressions	Efficient Construction of Reversible Transducers from Regular Transducer Expressions Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
regular languages	The amazing mixed polynomial closure and its applications to two-variable first-order logic
resource approximation	Resource approximation for the lambda-mu-calculus
restricted probabilistic tree stack automata	Probabilistic Verification Beyond Context-Freeness
reversible	The complexity of bidirected reachability in valence systems
S
Safe recursion	Cyclic Implicit Complexity
safety	Deciding Hyperproperties Combined with Functional Specifications
Satisfiability	Deciding Hyperproperties Combined with Functional Specifications On the Satisfiability of Context-free String Constraints with Subword Ordering
Second-Order Arithmetic	A direct computational interpretation of second-order arithmetic via update recursion
semantics	Graded Monads and Behavioural Equivalence Games Semantics for two-dimensional type theory
semilinear sets	Geometric decision procedures and the VC dimension of linear arithmetic theories
semiring semantics	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
semistrict	A Type Theory for Strictly Unital Infinity-Categories
separation	The amazing mixed polynomial closure and its applications to two-variable first-order logic
Sequences of probability distributions	Stochastic Games with Synchronizing Objectives
sets with atoms	Solvability of orbit-finite systems of linear equations
Sherali-Adams	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
shrubdepth	Treelike decompositions for transductions of sparse graphs
Sigma-monoid	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
signal flow graph	Monoidal Streams for Dataflow Programming
Skolem Conjecture	On the Skolem Problem and the Skolem Conjecture
Skolem Problem	On the Skolem Problem and the Skolem Conjecture
soundness	The complexity of soundness in workflow nets
Space complexity	Reasonable Space for the Lambda-Calculus, Logarithmically
Stochastic games	Stochastic Games with Synchronizing Objectives
stochastic process	Monoidal Streams for Dataflow Programming
Straubing conjecture	The Regular Languages of First-Order Logic with One Alternation
stream	Monoidal Streams for Dataflow Programming
strict units	A Type Theory for Strictly Unital Infinity-Categories
String constraints	On the Satisfiability of Context-free String Constraints with Subword Ordering
structural soundness	The complexity of soundness in workflow nets
Subword order	On the Satisfiability of Context-free String Constraints with Subword Ordering
Sweedler dual	A functorial excursion between algebraic geometry and linear logic
syllepsis	Syllepsis in Homotopy Type Theory
symmetric choice	Choiceless Polynomial Time with Witnessed Symmetric Choice
Synchronization	Stochastic Games with Synchronizing Objectives
Synthetic domain theory	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
synthetic probability	Probability monads with submonads of deterministic states
T
Taylor expansion	Resource approximation for the lambda-mu-calculus
Team Semantics	Temporal Team Semantics Revisited
Temporal Logic	Temporal Team Semantics Revisited
Termination	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
thunk-force categories	Probability monads with submonads of deterministic states
timed automata	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
transducers	Efficient Construction of Reversible Transducers from Regular Transducer Expressions
transduction	Stable graphs of bounded twin-width Treelike decompositions for transductions of sparse graphs
transductions	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
twin-width	Stable graphs of bounded twin-width
two-variable first-order logic	The amazing mixed polynomial closure and its applications to two-variable first-order logic
type systems	Curry and Howard Meet Borel
type theory	A Type Theory for Strictly Unital Infinity-Categories Semantics for two-dimensional type theory Normalization for Multimodal Type Theory
U
Undecidability	When Locality Meets Preservation
Uniform Sampling	On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
universal graphs	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
V
VC dimension	Geometric decision procedures and the VC dimension of linear arithmetic theories Computable PAC Learning of Continuous Features
vector addition systems	Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes The complexity of bidirected reachability in valence systems The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Verification	Computing the Density of the Positivity Set for Linear Recurrence Sequences
W
Weighted automata	The boundedness and zero isolation problems for weighted automata over nonnegative rationals
well-quasi-ordering	When Locality Meets Preservation
workflow nets	The complexity of soundness in workflow nets
Ł
Łós-Tarski Theorem	When Locality Meets Preservation

Disclaimer | Powered by EasyChair Smart Program