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 definability
Search options questions only
not deleted
user 43439
definability by formulas in first-order logic, e.g. as explained at https://en.wikipedia.org/wiki/Definable_set, or as in J. Robinson's first-order definition of the integers in the field of rationals
7
votes
1
answer
450
views
Are no infinite subsets of the set of all propositional atoms definable in this structure, e...
I asked this on Math Stack Exchange, but apparently no one paid attention to it. So, I am asking it again, filling in the background necessary to understand it.
Consider a countably infinite set $P$ o …
- 2,013
0
votes
1
answer
125
views
An infinite Leibnizian structure in a finite language with precisely $n$ definable elements
This question was inspired by Joel David Hamkins's excellent question on Leibnizian structures with no definable elements. Let $n$ be a positive integer. Is there an infinite structure in a finite lan …
- 2,013
4
votes
0
answers
549
views
A question regarding the "math tea" argument
Joel David Hamkins published a paper where he analyzes the "math tea" argument, namely, the argument that some real numbers are undefinable. He constructed a countable model of set theory where all se …
- 2,013