Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with symbolic-logic
Search options not deleted
user 35100
For questions related to symbolic logic, also known as mathematical logic. Topics might range from philosophical implications of metamathematical results to technical questions.
1
vote
1
answer
81
views
Does this symbolic logic proof work?
So, I have this proof:
Let a be an open sentential variable.
Let K and C be prepositional variables asserted of sentences.
Given
K(a) <=> C(a) & a
C(a) <=> C( C(a))
C(a & b) <=> C(a) & C(b)
I …
- 87