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 2693
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.
26
votes
3
answers
6k
views
Presburger Arithmetic
Presburger arithmetic apparently proves its own consistency. Does anyone have a reference to an exposition of this? It's not clear to me how to encode the statement "Presburger arithmetic is consisten …
- 35.5k
1
vote
Propositional logic and first order logic textbook
As a clear introduction to propositional and first order logic for the mathematically minded, I think Logic and Structure by Van Dalen is in a class of its own. The majority of the book is not particu …
- 464
10
votes
Accepted
Why is every finite set Diophantine?
Or, very simply stated, given the finite set $S = \{a_1, \dots , a_k\}$, consider the diophantine equation: $$(n-a_1)\dots(n-a_k)=0.$$
EDIT: Then we can write S as $\{ \ n \ | \ \exists x : (n-a_1)\do …
- 47.1k
7
votes
The sets in mathematical logic
There are a few problems you seem to be having. First of all, the statement "mathematical logic depends on ZFC" doesn't make sense.
As mathematical logicians, when we study formal systems, we should …
- 464
5
votes
The best text to study both incompleteness theorems
Peter Smith's book is great. It's very readable and contains all the details. The problem is that it doesn't leave anything for you to do! If you want to get your hands dirty and work a few things out …
- 464