• No results found

Two Open Problems and a Conjecture in Mathematical Logic

N/A
N/A
Protected

Academic year: 2020

Share "Two Open Problems and a Conjecture in Mathematical Logic"

Copied!
12
0
0

Loading.... (view fulltext now)

Full text

(1)

Home Page

Title Page

Contents

JJ II

J I

Page1of12

Go Back

Full Screen

Close

Quit TWO OPEN PROBLEMS AND A CONJECTURE IN

MATHEMATICAL LOGIC

K. K. NAMBIAR

ABSTRACT. The first open problem is concerned with introducing three derivation rules in predicate calculus and the second one suggests a so-lution for the continuum hypothesis. The conjecture says that there will always be profound questions in any significant theory, over and above those suggested by G¨odel’s incompleteness theorems.

Date: January 21, 2002.

(2)

Home Page

Title Page

Contents

JJ II

J I

Page2of12

Go Back

Full Screen

Close

1. INTRODUCTION

(3)

Home Page

Title Page

Contents

JJ II

J I

Page3of12

Go Back

Full Screen

Close

Quit

2. OPEN PROBLEM ONE

A metalanguage has its obvious deficiencies, and our first problem inves-tigates the possibility of proving the incompleteness theorems without using any metalanguage. Following are some notations needed to state the open problem.

F(x): We make use of the known fact that the formulas of an axiomatic theory can be enumerated lexicographically. The functionF(x) gives the xthformula in the list. In the formation of the formulas we assume that more than one complementation at a time is not allowed, since it does not serve any purpose. We will refer toF(x)as the formula stored at addressx.

x: The address at whichF(x)is stored we callx. ThusF(x) =F(x). It is easy to see thatxis a primitive recursive function ofx, andx=x.

P(x, y): The primitive recursive predicate (a very long formula) which says that the formulaF(y)is a proof of the formulaF(x).

(4)

Home Page

Title Page

Contents

JJ II

J I

Page4of12

Go Back

Full Screen

Close

F(c): The formula∼ ∃x D(x)D(x)has to appear somewhere in our list, we call that address, c. We will use the symbolC for ∼ ∃x D(x)D(x). C says that it is impossible to derive bothF(x) andF(x). C is read as consistency and,Cas contradiction.

Consider the possibility of adding the following three derivation rules to the first-order predicate calculus with equality. The>used here is a rotated turnstile symbol with the meaning that the following line can be derived from what precedes.

1. Validity rule: This rule essentially gives a syntactic definition of truth.

D(u)

>

F(u)

(5)

Home Page

Title Page

Contents

JJ II

J I

Page5of12

Go Back

Full Screen

Close

Quit

.. . F(u)

>

D(u)

3. Contradiction rule: This rule is based on the fact that any formula that leads to a contradiction cannot be derived.

F(u)

(starting assumption) ..

. C

>

C⇒D(u)

(6)

Home Page

Title Page

Contents

JJ II

J I

Page6of12

Go Back

Full Screen

Close

Using these derivation rules, we can derive the incompleteness theorems for any significant theory, without using any metalanguage. The derivations are short and straightforward, see [1]. Now, we can state our first problem.

Open Problem 1:

If we use the three derivation rules given above, in a significant theory, will they introduce contradictions in the theory?

(7)

Home Page

Title Page

Contents

JJ II

J I

Page7of12

Go Back

Full Screen

Close

Quit

3. A CONJECTURE

If it is safe to use these derivation rules in an axiomatic theory, then we can divide the formulas in the theory into four mutually exclusive categories: F is a theorem, if a derivation exists forF, but not forF. F is a falsehood, if a derivation exists forF, but not forF.Fis an introversion, if a derivation exists forF when F is assumed, and a derivation for F exists whenF is assumed. F is a profundity, if a derivation exists for neitherF norF, and it is not an introversion. Note that in ZF theory, according to our classification, generalized continuum hypothesis and axiom of choice are profundities and consistencyCis an introversion [2].

An even more serious consequence is that G¨odels incompleteness theo-rems get elevated to a higher level. We will call a theory profound, if it contains a profundity. Here is an issue worth considering:

Conjecture:

(8)

Home Page

Title Page

Contents

JJ II

J I

Page8of12

Go Back

Full Screen

Close

(9)

Home Page

Title Page

Contents

JJ II

J I

Page9of12

Go Back

Full Screen

Close

Quit

4. OPEN PROBLEM TWO

It is easy to state the second open problem without any preliminaries, because of the enormous research that has gone into the investigation of the continuum hypothesis in the last century. Ifkis an ordinal, we will write ℵα

k

for the cardinality of the set of all subsets ofℵαwith the same cardinality as k.

Open Problem 2:

If we accept the equation

ℵα+1=

ℵα

ℵα

,

(10)

Home Page

Title Page

Contents

JJ II

J I

Page10of12

Go Back

Full Screen

Close

The importance of the equation above is that if we accept it, the derivation of the generalized continuum hypothesis is almost trivial as outlined below.

2ℵα=

ℵα 0 + ℵα 1 + ℵα 2 +· · · ℵα ℵ0 +· · · ℵα ℵα .

Since, there areℵαterms in this addition and ℵkα

is a monotonically non-decreasing function ofk, we can conclude that

2ℵα=

α

ℵα

.

The generalized continuum hypothesis

ℵα+1= 2ℵα,

(11)

Home Page

Title Page

Contents

JJ II

J I

Page11of12

Go Back

Full Screen

Close

Quit

5. CONCLUSION

(12)

Home Page

Title Page

Contents

JJ II

J I

Page12of12

Go Back

Full Screen

Close 1. K. K. Nambiar, Real Set Theory, Computers and Mathematics with Applications 38 (1999),

no. 7-8, 167–171.

2. K. K. Nambiar, Intuitive Set Theory, Computers and Mathematics with Applications 39 (1999), no. 1-2, 183–185.

· · · for a printable version of this paper· · ·

click here

References

Related documents

accordance with policy requirement 2 of the Capital Works Management Framework , when developing work programs for their building projects, departments must consult with the

PCTs as local commissioners have a responsibility to decide resources in many diff erent activities in order to meet the goals of healthcare (Wade et al., 2006). It has to be done

 Using symmetric algorithms for payment card data invites

Not every theorem in set theory needs the assumption of the Axiom of Choice, but we will frequently assume it for the existence of different types of sets.... 1.4 Ordinals

The drive uses an adaptive flux observer for speed estimation and a discrete space vector modulation direct torque control (DSVM-DTC) technique for torque and stator flux

The refund shall be based on the cost and length of the program All tuition beyond the current enrollment period shall be refunded when a student terminates.. Registration

A Multienzyme Complex Channels Substrates and Electrons A Multienzyme Complex Channels Substrates and Electrons through Acetyl-CoA and Methane Biosynthesis Pathways in

Companies can set a threshold on the number of days of leave to provide, and then implement different leave options based on the profile of the employees. For more information