~/talk

The Expressiveness of Recognizability by Orbite Finite Nominal Monoids

Talkat Symmetry, Logic, Computation 2016 · 2016-11-07..11-10
links:none on file
slides:none on file

Claim: monadic second-order logic with rigid guards exactly captures languages recognisable by orbit-finite nominal monoids, and the first-order fragment corresponds to the aperiodic sub-class. Construction uses nominal sets, an effective syntactic enforcement of rigidity, a projectability property to control MSO projection (power-set) and a detailed analysis of Green’s relations to build MSO formulas from monoid elements. Result restores many algebraic/logical equivalences lost in naïve register models and yields effective translations both ways.

AI-written summary · about

  1. 0:00Introduction
  2. 1:19Two key CRMs
  3. 3:04The Story of Data
  4. 6:11Results
  5. 7:25Recap
  6. 11:40Examples
  7. 13:49Logics
  8. 13:59Data Words
  9. 15:54Undecidability
  10. 17:34What we know
  11. 19:09What is rigidity
  12. 24:21Proof
  13. 24:34The Problem
  14. 25:28The Solution
  15. 26:20The Other Way
  16. 29:02The Greens Relation
  17. 29:20Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.