Skip to main content
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
Search options not deleted user 140821

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.

11 votes
1 answer
587 views

PAC and totally real fields

A field $K$ is called pseudo-algebraically closed (PAC) if every absolutely irreducible variety over $K$ has a $K$-point. Let $L$ be the maximal totally real subfield of $\overline{\mathbb Q}$. A few …
1 vote

Is this theory the complete theory of the real ordered field?

EDIT 2: This wrong proof at least shows that the upper bound property holds in $K(\pi)$, when $\phi$ is $\Sigma_1$. Indeed, if $\phi$ is $\Sigma_1$ then we have the inclusion of solution sets $$ \phi( …
Spencer Dembner's user avatar