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 539267
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
0
answers
85
views
Intuitionistic countermodels in which $u \leq v \implies M_u \leq M_v$
In Fitting's Intuitionistic Logic Model Theory and Forcing, the following theorem is proven:
If $X$ is a formula with no universal quantifiers and $\not\vdash_I X$, then there is a countermodel $(\ma …
- 139
1
vote
0
answers
69
views
How many constant symbols can a set of intuitionistic formulas have for completeness to hold?
Fitting proves a version of the completeness theorem for intuitionistic FOL in his book on intuitionistic model theory and forcing.
Let $U$ be any set of formulas without parameters (i.e. constant sy …
- 139