Axiomatizable Things & First Order Logic Stuff

  • Context: Graduate 
  • Thread starter Thread starter Jerbearrrrrr
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the axiomatizability of various mathematical structures within first-order logic, specifically focusing on finite fields of characteristic 2, infinite fields of characteristic 2, and finite groups. Participants explore the implications of the Compactness theorem and its relation to completeness and axiomatization.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants assert that there is no first-order theory whose models are precisely the finite fields of characteristic 2.
  • Others claim that the theory of infinite fields of characteristic 2 cannot be finitely axiomatized.
  • It is proposed that the class of finite groups cannot be axiomatized.
  • A participant references the Compactness theorem, suggesting that if every finite subtheory of a theory T is consistent, then T itself is also consistent.
  • One participant expresses uncertainty about the contradictions arising in proofs related to these axiomatization issues and seeks further resources.
  • Another participant notes that many mathematical structures, such as the real field and second-order Peano arithmetic, are also not axiomatizable in first-order logic.
  • There is mention of the Kaplan-Geach sentence as an example of something that cannot be expressed in first-order logic.
  • Some participants discuss the construction of groups that satisfy certain conditions while having an infinite number of elements, indicating a potential misunderstanding of the implications of the Compactness theorem.

Areas of Agreement / Disagreement

Participants express a range of views on the axiomatizability of various structures, with no consensus reached on the implications of the Compactness theorem or the specific examples discussed.

Contextual Notes

Participants note limitations in understanding the proofs and the specific conditions under which certain structures cannot be axiomatized, indicating a need for further exploration of the topic.

Jerbearrrrrr
Messages
124
Reaction score
0
First order logic stuff.
A lot of things don't seem to be axiomatizable. I have like a few remarks that need explaining if anyone could:

-There is no first order theory whose models are precisely the finite fields of characteristic 2.

-The theory of infinite fields of characteristic 2 has no finite axiomatization

-The class of finite groups cannot be axiomatized.

Seems to be related to completeness. Not sure D:

thanks
 
Physics news on Phys.org
This follows from the Compactness theorem: given a theory T in some language L, if every finite subtheory of T is consistent, then so is T itself (where 'consistent' means 'has a model').

I could try to explain how it follows from this, but you can probably look it up somewhere without too much effort.
 
I don't really know what I'm looking for so I'm not sure what to search :\

What kind of contradictions do the proofs of these things end up with?
I have a non-example of an attempt to axiomatize the fields of characteristic "2 or 3", but I can't decode it. I must have missed something or miscopied.

Do you know of any sites or material I could look for in the library?
 
The compacteness theorem is on pratically all logic textbooks, but if you want a quick look, see here (corollary 22):

http://plato.stanford.edu/entries/logic-classical/#5"

There are a lot of things that aren't axiomatizable in first-order logic: the real field \mathbb R and second-order Peano arithmetic aren't; also for the concept of "finite" set or class (this is actually a direct application of compactness). And this is not restricted to Mathematics: the Kaplan-Geach sentence "Some critics admire only each other" cannot even be written in first-order logic.

In current mathematical practice, it's usual to work with well behaved fragments of second-order logic to circunvent these limitations (full second order logic is a mess).
 
Last edited by a moderator:
I think I've got it now (the aim is to construct, say, a group that satisfies conditions to be finite, but have it to have an infinite number of elements), but thanks. I'll definitely have a read to make sure.

I knew about compactness, but I just couldn't figure out why it made certain things not-axiomatizable. Cheers.
 
Jerbearrrrrr said:
I think I've got it now (the aim is to construct, say, a group that satisfies conditions to be finite, but have it to have an infinite number of elements)

I'm not sure if what you're saying is what the compactness corollary (22) says:

"A set G of formulas is satisfiable iff every finite subset of G is satisfiable." It says nothing about whether G is (denumerably)infinite or finite. If at least one finite subset of G is not satisfiable, the set G is not satisfiable.
 
Last edited:

Similar threads

  • · Replies 34 ·
2
Replies
34
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 113 ·
4
Replies
113
Views
11K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 64 ·
3
Replies
64
Views
3K