Naked Science Forum

On the Lighter Side => New Theories => Topic started by: talanum1 on 09/09/2021 10:42:57

Title: Is the Axioms of Propositional Logic Provable?
Post by: talanum1 on 09/09/2021 10:42:57

Yes, some of them can be proven using axioms of operators called Stoppers and Attractors. See my manuscript at: https://www.ijasr.org/paper/IJASR0042515.pdf.

Title: Re: Is the Axioms of Propositional Logic Provable?
Post by: Bored chemist on 09/09/2021 12:01:10

Quote from: talanum1 on 09/09/2021 10:42:57

axioms of operators called Stoppers and Attractors.

Are these provable?

(Or is it turtles all the way down?)

Title: Re: Is the Axioms of Propositional Logic Provable?
Post by: talanum1 on 09/09/2021 16:30:10

Quote from: Bored chemist on 09/09/2021 12:01:10

Are these provable?

(Or is it turtles all the way down?)

Not as far as I know. They are unlikely to be provable but intuitively apply the notions of "attraction", "repulsion" and "stopping attraction".

Turtles all the way down can mean: axioms all the way down - I don't know.

Title: Re: Is the Axioms of Propositional Logic Provable?
Post by: Bored chemist on 09/09/2021 17:08:32

So, what you have  said is that, if we assume a set of axioms we no longer need to assume a different set of axioms.

That hardly seems to help.

Title: Re: Is the Axioms of Propositional Logic Provable?
Post by: talanum1 on 10/09/2021 17:29:13

Quote from: Bored chemist on 09/09/2021 17:08:32

So, what you have  said is that, if we assume a set of axioms we no longer need to assume a different set of axioms.

Using the most basic axioms, we don't need the higher level axioms any more.

The fact that Attractors and Stoppers (nearly) pushes back the axioms one level is amazing. It also proves the inference Rules: Modus Ponens and AND-introduction.