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 |
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.
4
votes
Candidate "AEC-yielding" fragments of bad logics
It's been so long since I've seen a good AEC question on here! In fact, so long I forgot the account info that gives me enough reputation to post this as a comment.
I think this will get you rather c …
3
votes
Compatibility of Łośian phenomena in second-order logic
I'm not sure I have a definitive answer, but three nice observations that are too long for comments:
If you relax from ultrafilters to extenders (seen as directed systems of ultrafilters), then there …
6
votes
Non-definability of graph 3-colorability in first-order logic
It’s worth noting that Joel’s great answer says that $n$-colorability is not definable by a single sentence of first-order logic. However, it is definable by a first-order theory.. That is, for each …
3
votes
Accepted
Vopěnka's Principle for non-first-order logics
This is a really late answer, but the answer to your question is "No." As a dual to the Theorem 6 that Thomas Benjamin mentions above (which I believe is a result of Stavi), Janos Makowsky proved tha …