Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

What kind of Algebra would RDF be? #2

Open
bblfish opened this issue Nov 26, 2019 · 0 comments
Open

What kind of Algebra would RDF be? #2

bblfish opened this issue Nov 26, 2019 · 0 comments

Comments

@bblfish
Copy link
Member

bblfish commented Nov 26, 2019

Kohei Kishida's article "Categories and Modalities" in Categories for the Working Philosopher, starts with a section "Syntax, Semantics and Duality" and explains how one thinks of logic algebraically.

Screen Shot 2019-11-26 at 13 15 23

RDF is a first order logic, but one should be able to take the structure of inference between Graphs and find this to be equivalent to a propositional logic of some form. Would it fit a Boolean Algebra, a Heyting Algebra, or something else?

We do seem to have a

  • G1∧G2≈G3 where G3 is the merging of those graphs.
  • G1⋁G2≈G3 where G3 is the intersection of those graphs, taking into account bnodes in Braatz's RDFHom
  • Do we have implication? In RDFHom that is graph morphisms.
  • Do we have negation? (I guess no)
  • do we have ⟘ or ⟙?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant