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 lo.logic
Search options not deleted
user 4262
first-order and higher-order logic, model theory, set theory, proof theory, computability theory, formal languages, definability, interplay of syntax and semantics, constructive logic, intuitionism, philosophical logic, modal logic, completeness, Gödel incompleteness, decidability, undecidability, theories of truth, truth revision, consistency.
2
votes
Condition of possibility = Co-Implication
You've answered your own question, in a way: if $q \hookrightarrow p$ is equivalent to $p \to q$ then the difference is only a matter of notation.
You say that
in logic many concepts are treated …
- 3,622
2
votes
Categorical Brouwer-Heyting-Kolmogorov interpretation
I don't have it with me, and I can't recall the exact details, but I'm pretty sure Lambek & Scott's Introduction to Higher-Order Categorical Logic (link) is what you're looking for. In particular, th …
- 3,622
11
votes
Accepted
What fails when using call/cc as realizer of the Peirce formula
I'm not sure what you mean by 'fail' here.
It is true, as you say, that classical proofs can exhibit behaviour that constructive proofs can't. In general, it's no longer true that a term of type A r …
- 3,622