Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Symmetry
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===In logic=== A [[binary relation|dyadic relation]] ''R'' = ''S'' Γ ''S'' is symmetric if for all elements ''a'', ''b'' in ''S'', whenever it is true that ''Rab'', it is also true that ''Rba''.<ref>Josiah Royce, Ignas K. Skrupskelis (2005) ''The Basic Writings of Josiah Royce: Logic, loyalty, and community (Google eBook)'' Fordham Univ Press, p. 790</ref> Thus, the relation "is the same age as" is symmetric, for if Paul is the same age as Mary, then Mary is the same age as Paul. In propositional logic, symmetric binary [[logical connective]]s include ''[[logical conjunction|and]]'' (β§, or &), ''[[logical disjunction|or]]'' (β¨, or |) and ''[[if and only if]]'' (β), while the connective ''if'' (β) is not symmetric.<ref>{{Cite web|url=https://cs.uwaterloo.ca/~a23gao/cs245_f19/slides/lec02_prop_syntax_nosol.pdf|title=Propositional Logic: Introduction and Syntax|last=Gao|first=Alice|date=2019|website=University of Waterloo β School of Computer Science|access-date=2019-11-12}}</ref> Other symmetric logical connectives include ''[[logical nand|nand]]'' (not-and, or βΌ), ''[[xor]]'' (not-biconditional, or β»), and ''[[logical nor|nor]]'' (not-or, or β½).
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)