About: Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : covidontheweb.inria.fr associated with source document(s)

AttributesValues
value
  • Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions
Subject
  • Feedback
  • Computational complexity theory
  • Theory of computation
  • Boolean algebra
  • Predicate logic
  • Finite model theory
  • Recursion
  • 1847 introductions
  • Algebraic logic
  • Logical calculi
  • Self-reference
  • Descriptive complexity
part of
is hasSource of
is resource representing a document's title of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software