6
votes
Accepted
Confusion about the consistency of $\mathsf{ZFC}+\neg\mathsf{Con}(\mathsf{ZFC})$
Yeah, you're mixing up the levels.
We formalize it as $$ \sf \lnot Con_{ZFC}\to \forall p\in Sentences_{LST}\; Prov_{ZFC}(p),$$ where $\sf Prov_{ZFC}$ is the same provability predicate that goes into $...
6
votes
Is "non-rigid" first-order axiomatisable?
Let $L' = L\cup \{\sigma\}$, where $\sigma$ is a unary function symbol not in $L$. Let $T'$ be $T$ together with axioms asserting that $\sigma$ is a non-trivial-automorphism (non-triviality is $\...
3
votes
Accepted
How to prove $\phi \models \psi$ iff $\phi \cup \{\neg \psi\}$?
I want to prove $\phi \models \psi$ iff $\phi \cup \{\neg \psi\}$ unsatisfiable.
What's the meaning of the union operator w.r.t. satisfiability in FOL?
We have to be careful with symbols. $a\models b$...
2
votes
Is "non-rigid" first-order axiomatisable?
Yes, you can add a new unary function symbol $g$ and then write down a schema that says "$g$ is a nontrivial automorphism" and add that to the schema saying "$M$ is infinite" and ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
first-order-logic × 5221logic × 3603
predicate-logic × 1378
model-theory × 887
quantifiers × 421
propositional-calculus × 336
set-theory × 279
discrete-mathematics × 210
elementary-set-theory × 168
natural-deduction × 161
solution-verification × 160
logic-translation × 154
peano-axioms × 134
formal-proofs × 117
proof-writing × 105
incompleteness × 105
proof-theory × 91
axioms × 88
foundations × 65
reference-request × 60
definition × 58
proof-explanation × 57
formal-languages × 55
satisfiability × 51
induction × 50