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 answers only
not deleted
user 6794
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.
9
votes
Accepted
Large almost disjoint family on $\mathbb{N}$ with property $\mathbf{B}$
One of the standard examples of an almost disjoint family of cardinality $\mathfrak c$ is the set of paths through the complete binary tree $2^{<\omega}$ (identified with $\omega$ via your favorite bi …
- 73.2k
8
votes
Accepted
Heuristic interpretations of the PA-unprovability of Goodstein's Theorem
You've shown how to prove, in PA, the statement "the Goodstein sequence starting with $p$ terminates" for any given $p$. But once $p$ is given, that statement has a proof in PA that just consists of c …
- 73.2k
10
votes
Accepted
Additive, multiplicative, and Dedekind infiniteness in ${\sf (ZF)}$
A theorem of Tarski says that the statement "all infinite sets are multiplicatively infinite" implies the axiom of choice (AC). But a theorem of Sageev says that "all infinite sets are additively infi …
- 73.2k
6
votes
Jensen's proof that $\diamondsuit$ holds at subtle cardinals
The "Suppose not" in the second paragraph is the reason for the fact in the third paragraph (and is thus what leads to the desired contradiction).
The point is that the definition of $\langle S_\alpha …
- 73.2k
12
votes
What would you do with a new model of linear logic?
The first thing I'd do with a new model is to see how it relates to things I already know. For example, how does it relate to game semantics?
What happens if I add weakening and contraction to the log …
- 73.2k
7
votes
Accepted
"Compactness length" of Baire space
Baire space is the union of $\mathfrak d$ (the dominating number) compact subsets. So, using equivalence relations that collapse those sets one at a time (i.e., one equivalence class is the set to be …
- 73.2k
7
votes
Accepted
Impredicativity, definition, recursion and conservatism
The formula $Gx\leftrightarrow A(G,x)$, expressing that $G$ is a fixed-point of the operator defined by $A$, is not sufficient, by itself, to uniquely characterize $G$. That operator may have many fix …
- 73.2k
16
votes
Ultraproducts of Banach spaces versus model theoretic ultraproduct
As a logician, I take the model-theoretic notion of ultraproduct as the primary one, so the following formal connection describes how to get the Banach-space ultraproduct from the model-theoretic one. …
- 73.2k
11
votes
Does every consistent extension of ZF have a model in the minimal transitive model of ZFC?
As Joel said, most of the consistent extensions $T$ of ZFC are not in the minimal transitive model $M$ of ZFC and therefore don't have models in $M$. It seems worth noting that this is the only reason …
- 73.2k
7
votes
Accepted
Minimum number of dense sets to make a filter an ultrafilter
No; $\mathfrak u'=\mathfrak c$.
To prove it, consider any $\mathcal C\subseteq[\omega]^\omega$ with cardinality $<\mathfrak c$. Working modulo finoite subsets of $\omega$ , and closing under (finitary …
- 73.2k
5
votes
Accepted
Decomposition of an ultrafilter on the fibers of a map
First, let me dispose of the trivial cases where $f$ is constant or one-to-one on a set in $\mu$. In the case of constant $f$, say with value $i$, you can take $\eta$ principal at $i$ and let $\mu_i$ …
- 73.2k
8
votes
Accepted
Are countable models constructible?
For the question in the text, the answer is no. Let $S$ consist of (1) a sufficient finite number of ZF axioms to provide an absolute (i.e., $\Delta_1$ in the Lévy hierarchy) definition of the constru …
- 73.2k
4
votes
Are there "typical" formal systems that have mutual consistency proofs? How long a chain of ...
No, it is not possible for two sufficiently strong, consistent theories to prove each other's consistency. Here's a sketch of the proof: Suppose A and B are sufficiently strong and prove each other's …
- 73.2k
19
votes
What sorts of extra axioms might we add to ZFC to compute higher Busy Beaver numbers?
$\DeclareMathOperator\BB{BB}$Philosophical issues, like acceptance (or non-acceptance) of large cardinals, won't affect $\BB(n)$, because the busy beaver function is defined arithmetically and so depe …
- 73.2k
4
votes
Accepted
Is the Rudin-Keisler ordering a continuous relation?
I assume that, in your definition of continuity of relations, the unspecified $V$ is intended to be an open subset of $Y$. With this assumption, the answer to your question is affirmative. If $V$ is a …
- 73.2k