All the research papers here are the byproducts of teaching at University of Pennsylvania, Drexel University, Indian Institute of Science, and Jawaharlal Nehru University. Simplifying the basic concepts of computer science gave ample scope for investigating the foundations. To view these papers, your browser should be setup to read PDF files.

1. A Note on Inductive Probability
Karl Popper's contention that probabilistic induction is impossible is contradicted with an example.
Read more

2. A Graph-Theoretic Proof of Arrow's Dictator Theorem
A simple and short proof of Dictator Theorem is given. Loosely stated, the theorem says that democracies are not possible.
Read more

3. An Axiomatic Definition of Shannon's Entropy
A definition of information, which forms the basis of the current information technology, is given in terms of two axioms.
Read more

4. A Graphic Illustration of Rogers-Ramanujan Identities
Apart from illustrating the RRIdentities using graph theory, two new forms of the identities are derived.
Read more

5. Ackermann Functions and Transfinite Ordinals
An important part of Cantor's set theory, which forms the foundations of mathematics, is the concept of transfinite ordinals. A systematic way of writing the sequence of ordinals is given.
Read more

6. NuMachine and NuAlgebra
An intuitive alternative to Turing Machine, the machine which defines computation, is given in terms of a directed graph.
Read more

7. Sentient Arithmetic and Godel's Theorems
Elementary Arithmetic of Godel is extended with three more derivation rules, and the Incompleteness Theorems are proved without using any metalanguage.
Read more

8. Justification of the Continuum Hypothesis
Intuitive arguments are given to suggest that Continuum Hypothesis should be accepted.
Read more

9. Hall’s Theorem and Compound Matrices
The powerful concept of compound matrices is used to prove Hall’s Theorem in a few steps.
Read more

10. Matchings and Pfaffians
Pfaffians are used to enumerate the matchings in undirected graphs.
Read more

11. Matrices with Elements from a Division Ring
The entire set of paths in a graph are enumerated by inverting a matrix with elements from a division ring.
Read more

12. Structured Labels and Directed Paths
The entire set of paths in a graph are enumerated by inverting a matrix with elements from a field.
Read more

13. Boyce-Codd Normal Form Decomposition
An algorithm is given to decompose a relation into BCNF.
Read more

14. Axiomatic Derivation of the Continuum Hypothesis
Continuum Hypothesis is derived from an axiom called Axiom of Monotonicity.
Read more

15. Real Set Theory
A set theory is defined in which Generalized Continuum Hypothesis and Axiom of Choice are theorems.
Read more

16. Intuitive Set Theory
A set theory is defined in which Skolem Paradox does not arise. Also, there are no sets which are not Lebesgue measurable.
Read more

17. Two Axioms to Extend Zermelo-Fraenkel Theory
Axiom of Monotonicity is used along with Zermelo-Fraenkel set theory to derive Generalized Continuum Hypothesis. Axiom of Fusion is used to investigate the cardinality of the set of points in a unit interval.
Read more

18. Generic Dependencies and Database Design
A generalization of the functional dependency called generic dependency is defined. Use of generic dependencies in database design is illustrated.
Read more

19. Visualization of Intuitive Set Theory
Intuitive Set Theory is defined as the theory we get when axioms of Monotonicity and Fusion are added to ZF theory. Cardinals in the theory are visualized using illustrations.
Read more

20. Compound Matrices and Three Celebrated Theorems
Laplace's Theorem, Binet-Cauchy Theorem, and Jacobi's Theorem are stated in terms of compound matrices and illustrated with examples.
Screen Version
Print Version

21. Shannon's Communication Channels and Word Spaces
Communication channels are represented by labelled graphs and analyzed using the concept of word spaces. A slight generalization of the notion of regular expressions is used to represent channel signals.
Screen Version
Print Version

22. Theory of Search Engines
Using Perron-Frobenius theorem, four stochastic matrices are defined, that can be used to rank the pages and hyperlinks in the Web.
Screen Version
Print Version

23. White Hole, Black Whole, and The Book
Physical and intellectual spaces are visualized making use of concepts from Intuitive Set Theory. A book containing all the proofs of mathematics is called The Book.
Screen Version
Print Version
Presentation2in1 Version
Presentation Version
Presentation Music Version
Producer Version

24. The Essence of Intuitive Set Theory
The ideas which motivated the defintion of intuitive set theory are explained. Only a passing acquaintance with the transfinite cardinals of Cantor is assumed on the part of the reader.
Screen Version
Print Version

25. Generalized Continuum Hypothesis and the Method of Fusing
The method of fusing explains the basis for the formulation of the axioms of monotonicity and fusion, the two axioms which define intuitive set theory.
Screen Version
Print Version

26. Generalized Continuum Hypothesis and the Axiom of Combinatorial Sets
Axiom of Combinatorial Sets is defined and used to derive generalized continuum hypothesis.
Screen Version
Print Version

27. Definition of Intuitive Set Theory
Two axioms which define intuitive set theory, Axiom of Combinatorial Sets and Axiom of Infinitesimals, are stated. Generalized continuum hypothesis is derived from the first axiom, and the infinitesimal is visualized from using the latter.
Screen Version
Print Version

28. Arrow's Paradox and the Fractional Voting System
It is shown that the fractional voting system can be used to cirumvent Arrow's paradox. The paradox states that fair elections are not possible with the present voting systems.
Screen Version
Print Version

29. Two Open Problems and a Conjecture in Mathematical Logic
The open problems attempt to extend Zermelo-Fraenkel set theory and the conjecture suggests an extension of Godel's incompleteness theorems.
Screen Version
Print Version

30. Twenty Problems of Information Technology
Out of the many significant and pressing problems of information technology, twenty are listed.
Choose Version

31. Teaching Generalized Pythagoras Theorem
Generalized Pythagoras theorem is discussed in terms of matrices.
Picture Version
Screen Version
Print Version

32. Teaching Generalized Continuum Hypothesis
Generalized Continuum Hypothesis is derived from a simple axiom called Axiom of Combinatorial Sets.
Screen Version
Print Version

33. Logsets and ZF Theory
Logset, the inverse of the powerset operation, is introduced into set theory.
Screen Version
Print Version

34. The Mathematical Universe in a Nutshell
The mathematical universe discussed here gives models of possible structures our physical universe can have.
Print Version
Screen Version
Presentation Version
Presentation2in1 Version

35. Geometrical Equivalents of Goldbach Conjecture and Fermat Like Theorem
Five geometrical eqivalents of Goldbach conjecture are given, calling one of them Fermat Like Theorem.
Print Version
Presentation Version
Producer Version

36. Uncertainty Principle of Phantom Mechanics
This paper shows that not only the particles of physics, but even a mathematical point in motion is governed by the uncertainty principle.
Read more

37. Information-Theoretic Equivalent of Riemann Hypothesis
Riemann Hypothesis is viewed as a statement about the capacity of a communication channel as defined by Shannon.
Print Version
Screen Version
Infotainment Version

38. Electrical Equivalent of Riemann Hypothesis
Riemann Hypothesis is viewed as a statement about the power dissipated in an electrical network.
Print Version
Screen Version

39. Derivation of Continuum Hypothesis from Axiom of Combinatorial Sets
Continuum Hypothesis is derived from an axiom called Axiom of Combinatorial Sets. The derivation is simple enough to be understood by any novice, who has a passing acquintance with cardinals of Cantor.
Print Version
Screen Version

40. Intuitive Set Theory: A Tutorial
Ackermann functions are used recursively to define the transfinite cardinals of Cantor. Axiom of Monotonicity is defined and used to derive Continuum Hypothesis. Axiom of Fusion is defined and used to split the unit interval into infinitesimals.
Screen Version1
Screen Version2

The web surfer is forewarned that many of the concepts discussed here are new, and hence they should be accepted only after careful consideration.

The web surfer is reminded that in ancient societies, the most gruesome punishment was reserved for those who polluted the village water. In today's global village the most gruesome punishment should be reserved for those who pollute the Internet. On my part, I have written all the papers here, as terse as possible, and all the cencepts as clear as I could, even when there was a possibility of their being wrong.

For a subset of the concepts above, concerned with the foundations of computer science, click here.

For a subset of the concepts above, concerned with the foundations of mathematics, click here.