r/MathematicalLogic • • Jul 03 '20

There is something rotten in Mathematical Logic

0 Upvotes

Agree, or care to pinpoint the flaw(s) in this ?

(Please keep it cool, calm, and on point at all times. Whether for, against or in between, argue with charity, quick dismissals not welcome. Appeals to established authority carry no weight.)


r/MathematicalLogic • • Jul 13 '20

On Intuitionism and Materialism

Thumbnail self.math
0 Upvotes

r/MathematicalLogic • • Mar 22 '20

Compactness Theorem II

0 Upvotes

Hey guys! I was trying to prove if A is true in every model of gamma then there is a finite subset delta such that A is true in every model of delta using Compactness Theorem I. Does anyone have any ideas regarding how to do this?


r/MathematicalLogic • • May 25 '20

Uncountability and self-reference: A perspective from a computer science person

1 Upvotes

Hi all. So I've been curious about exploring the basis of logical reasoning for a long time. There's not many people to talk about these subjects in real life, so I'm asking here. Apologies if I'm off topic.

When we learned about "uncountable" sets in school and university, the concept always gave me a headache. How can there be numbers that don't have a finite description? How can we say that something exists that we can not describe? I later took on a mathematical logic course in university, and it helped me refine my concept of what that means a little. But only in the last few days did I manage to put my issue with the concept of "uncountable" into words.

So I haven't formalized this yet, and I would need to get a lot more into mathematical logic to do this properly. Rather, I'd like to present my intuition using an example for now.

In my university maths course, we proved that the set of functions N -> {0, 1} is uncountable. Proof (informal): Assume that it was countable, then there has to be a surjective function `m` from N to the set of such functions. We can then use some clever tricks to construct a new function `g`: N -> {0, 1} from `m` such that `g` is not contained in the set of functions. (The way that it is constructed is not important to me)

The "mathematician" conclusion from this is that the set of such functions is not countable. My intuition as a computer scientist is a different one: Why is it even "legal" in our language, to refer to meta-concepts of the language? That is, why is it allowed to introduce a symbol for "the set of all functions with property X" in the first place?

For instance, if I were to define a function "f: N -> N: x -> f(x) + 1", that would clearly be illegal. The definition of the function references itself, which leads to a contradiction. But likewise, I would argue that allowing to reference "the set of all functions", when defining a function that is included in that set, introduces a more indirect form of self-reference that is equally illegal.

In other words, the conclusion that uncountable sets exist, i.e. that things we can not describe in finite terms exist, arises from the fact that we allow self-reference. We are trying to create a language that can talk about itself, or rather about its own framework, and thus the "world" behind that language can not be possible to express in finite terms.

And this same type of problem is found in other areas as well: In set theory, self-reference would cause the Russel's paradox, so we have to for example introduce the concept of "classes" to talk about "the set of all sets" (excuse my wording). In theoretical computer science, if we allow for machines that are powerful enough to analyze themselves, we introduce the halting problem, another contradiction.

But it seems to me, that all these problems could in theory be avoided by forbidding self-reference? When we have a language that talks about sets, we can't talk about "the set of all sets", we need a meta-language for that. When we have a language that talks about functions, we can't have "the set of all functions", we again need a meta-language. And when we talk about machines that can analyze machines, we can't describe a machine that can analyze arbitrary machines, again we need a "meta-machine" to analyze machines up to a certain "level of complexity".

In conclusion, should it not be possible to build mathematical models in which there is no "uncountable"? Do we really need the concept of uncountable, or could we not replace it by creating higher level "meta-models" that talk about terms within lower level models?

Again, I'm not trying to create a formal proof. Just asking some questions about the fundamental truths of logical thinking, and hoping to get some input on it.


r/MathematicalLogic • • Apr 30 '20

Looking for a proof "everything that is provable by a computer is provable by an idealized human mind?"

0 Upvotes

It should obviously be true but I was just curious if someone proved it. Is there is a proof for the proposition "Everything that is provable by a computer is provable by an idealized human mind"?


r/MathematicalLogic • • Nov 23 '19

Forcing: Conceptual Change in the Foundations of Mathematics

Thumbnail
youtube.com
5 Upvotes

r/MathematicalLogic • • Dec 06 '19

Confused with interpretation

1 Upvotes

What does this even mean? I'm having trouble translating this into a phrase in english. What would be a concrete example of such a term that satisfies this? I'm so confused I'm not even sure I'm asking the question properly.


r/MathematicalLogic • • Jun 22 '19

Kleene's theorem I don't understand it's concept

0 Upvotes

"A language is said to be regular if it can be represented by using a Finite Automata or if a Regular Expression can be generated for it." Somehow it's intuitively illogical for me, because the algorithms (regular expressions are some kind of theorethical concepts) and so-called "written evidences", "the formulations of problem solving" existed separately before the introduction of the concept of Turing's machine. Computers that would implement them came after. The theory is always BEFORE practice. The theorem cannot be proved by saying that something "has emerged" after my theory, and that thing will be used to prove the existence of my theory. So I wonder why a regular language can not exist independently of the machines that recognize it? It has always been: an algorithm was first to be created and then a computer that will implement this algorithm showes up later.


r/MathematicalLogic • • Oct 02 '19

Greek alphabet notation pronunciation

1 Upvotes

Here’s a weirdly tangential question - how do you pronounce Greek letters in notation? I’ve asked two math PhDs and neither are sure. Does anyone know?

Say you’ve just got modern Greek, Koine Greek and Ancient (Homeric) Greek. Letters sound a little different in each. Pick an alphabet.

/xposted


r/MathematicalLogic • • Sep 10 '19

Discussion: Importance of Proof vs Statement of the Incompleteness Theorems

1 Upvotes

For those of you well acquainted with the first Incompleteness Theorem, I have been thinking about what the important part of the Incompleteness Theorems are and have come to the conclusion that the method of proof—arithmetization and diagonalization—is not the important thing to take away from the theorem.

The important part is that any recursive axiomatization of arithmetic fails to define the natural numbers up to isomorphism (or maybe weaker, elementary equivalence).

Thoughts? Do you agree or disagree about the important big picture take-away from the theorem?


r/MathematicalLogic • • Sep 17 '19

What Are You Working On?

1 Upvotes

This recurring thread will be for general discussion on whatever mathematical logic-related topics you have been or will be working on over the week. Not all types of mathematics are welcomed, but all levels are!


r/MathematicalLogic • • May 15 '19

Explanation about forming CNF and DNF expressions from the truth tables. I think this explanation is very simple and logical. What do you think?

Thumbnail
arumapress.blogspot.com
1 Upvotes

r/MathematicalLogic • • Jul 07 '20

Sums Σ

1 Upvotes

What are sums formally? How are they defined?

Let's assume the sum below has index k and begins at 1.

If I have the statement Σn a_k < C, the k should be quantified somehow. Or at least quantifiable in formal logic. Right?

The quantification should be local to the sum and to the sum only. For instance, ∃k.Σn a_k < k is syntactically well defined, and the k bounded by the ∃ is not the one bounded by the sum.

Is this first order even? It wouldn't look right to use an ∃ nor a ∀ to bound the index variable though.

And if this is not the method, how do you formalize this?


r/MathematicalLogic • • May 28 '20

Indeterminable statements

1 Upvotes

Do indeterminable statements break the definition of logic as Boolean (either true or false)? Or is it the case that indeterminable statements are defined as both true and false as the Boolean "or" is an inclusive "or"? E.g. the continuum hypothesis


r/MathematicalLogic • • Aug 20 '21

Could someone please explain these for me? I’m very new to logic and have no clue how to solve these questions.

Post image
1 Upvotes

r/MathematicalLogic • • Sep 25 '20

Mathematical Logic vs Foundations of Math vs Philosophical Logic - Harvey Friedman

9 Upvotes

I think these descriptions are useful, especially if you're just learning about this stuff.

  • Foundations of Mathematics. Here the "practice of
    mathematics" (mathematical practice) is regarded as an object of study,
    without questioning its "correctness", "validity", etcetera.
    Mathematical practice is treated as a phenomenon to be modeled - not an
    activity to be questioned. A crude model of mathematical practice is the
    ZFC system. Finer models are given by fragments of ZFC. There have been
    startling discoveries, starting with Goedel. Advances are judged
    according to how much insight is gained about mathematical practice. The
    future is huge, as there are all sorts of aspects of mathematical
    practice that at present have not been properly modeled or only partly
    modeled - but hold promise for deeper modeling. E.g., classification,
    simplicity, naturalness.

  • Mathematical Logic. This is a branch of mathematics
    that investigates the various fundamental mathematical structures
    emanating out of Foundations of Mathematics - for their own sake. There
    is no aim to address issues in Foundations of Mathematics. A subarea of
    Mathematical Logic is clarifying: there has been some reasonably
    successful attempts to apply these investigations to problems and
    contexts in mathematics, creating a useful mathematical tool. The most
    common name for this is Applied Model Theory.

  • Philosophical Logic. This attempts to analyze and treat
    logical notions in their most rudimentary form, independently of how
    they are used in mathematics. Mathematics, like everything else, is
    something to be questioned, justified, criticized, etc. I have not
    worked in this, because I do not sense realistic prospects for
    spectacular findings - or at least, the realistic prospects are much
    higher in 1.

"Foundations of Mathematics is between mathematics and philosophy, and has a different perspective than either of the two. "


r/MathematicalLogic • • May 26 '20

Harvey Friedman's Boolean Relational Theory

2 Upvotes

Can anyone give an explanation of what Harvey Friedman's Boolean Relational Theory is? I see that he started this subject as a means to get at concrete mathematical incompleteness.

https://u.osu.edu/friedman.8/foundational-adventures/boolean-relation-theory-book/

Side question: What has the reception of this project been in the field? Do logicians tend to see it as a fruitful endeavor? Or have people stopped paying attention to Friedman?


r/MathematicalLogic • • Jun 10 '20

I was wondering

2 Upvotes

Probably a stupid question, If T is set of all tautologies, what is |T|? Obviously its not finite since for ex. p<=>p<=>p<=>... Just curious


r/MathematicalLogic • • May 14 '19

What Are You Working On?

2 Upvotes

This recurring thread will be for general discussion on whatever mathematical logic-related topics you have been or will be working on over the week. Not all types of mathematics are welcomed, but all levels are!


r/MathematicalLogic • • Dec 17 '19

What Are You Working On?

2 Upvotes

This recurring thread will be for general discussion on whatever mathematical logic-related topics you have been or will be working on over the week. Not all types of mathematics are welcomed, but all levels are!


r/MathematicalLogic • • Nov 06 '19

I just started learning mathematical logic yesterday and I am having hard time doing that.

2 Upvotes

it is kinda naive but this is how I thought of it, If I wanted to understand mathematics deeply I should start with learning foundations (mathematical logic), and it is very tempting when you read that all what you need to learn that is "just some mathematical maturity".

I am using this book "handbook of mathematical logic", passed the preface and introductory texts with more excitement and got stuck at the first theorem the book presented: compactness theorem. didn't get stuck at understanding the theorem text itself but how it is used afterwards. either ways, I got stuck.

this made me take a step back thinking about that, and my question is, should I still push to learn this even if it doesn't seem productive, or should I downgrade and invest in building some mathematical maturity by studying other topics?

thanks.


r/MathematicalLogic • • Mar 20 '20

Completeness of the group theory

2 Upvotes

I know that the group theory is not complete but I'm having a hard time proving it.


r/MathematicalLogic • • Jul 02 '19

What Are You Working On?

2 Upvotes

This recurring thread will be for general discussion on whatever mathematical logic-related topics you have been or will be working on over the week. Not all types of mathematics are welcomed, but all levels are!


r/MathematicalLogic • • May 16 '19

What do you think of Cartesian Logic?

2 Upvotes

r/MathematicalLogic • • Aug 12 '21

Consistency of mathematics

3 Upvotes

Is the Consistency of mathematics (you can think of ZFC or other alternative formal system for mathematics) is important?! Why?! If it is inconsistent, what would happen?!

I'm glad if you introduce me some articles about this subject.