Logic and Foundations Commons^™

Does A Mathematical/Scientific Worldview Lead To A Clearer Or More Distorted View Of Reality?: Purposive Musings Inspired From Readings In The Urantia Book, The Cosmic Family, Volume I, And Elsewhere, Jeru

Humanistic Mathematics Network Journal

No abstract provided.

Notes On Formal Constructivism, D. Joyner, P. Lejarraga

Humanistic Mathematics Network Journal

Our aim is to sketch some ideas related to how we (as in, we two) think we (as in, we humans) think. "That theory is useless. It isn't even wrong." - Wolfgang Pauli. Our hope in this paper is to provide a theory, admittedly somewhat vague, of how we think about mathematics. We also hope our ideas do not cause the reader to be reminded of Pauli's quote above. These notes were motivated by the interesting book by Changeaux and Connes.

Mathematisation Of The Science Of Motion And The Birth Of Analytical Mechanics : A Historiographical Note, Marco Panza

MPP Published Research

Usually, one speaks of mathematization of a natural or social science to mean that mathematics comes to be a tool of such a science: the language of mathematics is used to formulate its results, and/or some mathematical techniques is employed to obtain these results.

Preface, Alexander Kurz

Engineering Faculty Articles and Research

No abstract provided.

Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.

Proceedings Of The First International Conference On Neutrosophy, Neutrosophic Logic, Neutrosophic Set, Neutrosophic Probability And Statistics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In 1960s Abraham Robinson has developed the non-standard analysis, a formalization of analysis and a branch of mathematical logic, that rigorously defines the infinitesimals. Informally, an infinitesimal is an infinitely small number. Formally, x is said to be infinitesimal if and only if for all positive integers n one has xxx < 1/n. Let &>0 be a such infinitesimal number. The hyper-real number set is an extension of the real number set, which includes classes of infinite numbers and classes of infinitesimal numbers. Let’s consider the non-standard finite numbers 1+ = 1+&, where “1” is its standard part and “&” its non-standard part, …

Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X, namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic.

On Minimal Regular Graphs With Given Constraintsm, Che Sheng Gan

Student Works (2000-2009)

A classical question in graph theory has been the search of cages. The problem of determining the smallest (r,g)-cage is unsolved for most pairs of (r,g) and is extremely hard in the general case. Finding the crossing number of a graph is another challenging problem in graph theory. The crossing numbers of very few classes of graphs arc known. In this thesis, we would like to (a) investigate those smallest regular graphs with given girths and having small crossing numbers. In particular, we investigate those smallest regular graphs with given girths and crossing number c, for c ∈ {0, 1, …

Fivefolded Asymmetrical Hand: A Poetic Essay, S. Robert Wilson

Humanistic Mathematics Network Journal

No abstract provided.

Journal Review: Third International Anthology On Paradoxism, Joanne Growney

Humanistic Mathematics Network Journal

No abstract provided.

What "Is" Mathematics?: In Memoriam Of Gian-Carlo Rota, Gian-Carlo Rota

Humanistic Mathematics Network Journal

No abstract provided.

Abstracting Aristotle’S Philosophy Of Mathematics, John J. Cleary

Research Resources

In the history of science perhaps the most influential Aristotelian division was that

between mathematics and physics. From our modern perspective this seems like an unfortunate deviation from the Platonic unification of the two disciplines, which guided Kepler and Galileo towards the modern scientific revolution. By contrast, Aristotle’s sharp distinction between the disciplines seems to have led to a barren scholasticism in physics, together with an arid instrumentalism in Ptolemaic astronomy. On the positive side, however, astronomy was liberated from commonsense realism for the conceptual experiments of Aristarchus of Samos, whose heliocentric hypothesis was not adopted by later astronomers because …

La Révolution Scientifique, Les Révolutions, Et L'Histoire Des Sciences. Comment Ernest Coumet Nous A Libérés De L'Héritage D'Alexandre Koyré, Marco Panza

MPP Published Research

Dans son intervention au colloque Koyré (Paris, 1986), Ernest Coumet a suggéré que le terme «révolution scientifique» ne désigne pas chez Koyré un événement historique, mais un idéaltype, au sens de Max Weber. L'auteur discute d'abord cette thèse de Coumet et expose les arguments que ce dermier apporte pour la soutenir. Dans la deuxième partie de l'article, il critique l'usage de la notion de révolution en histoire des sciences, en s'opposant en particulier à la possibilité de distinguer dans les productions des savants une «pensée scientifique» qui serait influencée par la «pensée philosophique» et dont les bouleversements marqueraient l'avènement d'une …

Proceedings Of The First International Conference On Neutrosophy, Neutrosophic Logic, Neutrosophic Set, Neutrosophic Probability And Statistics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In 1960s Abraham Robinson has developed the non-standard analysis, a formalization of analysis and a branch of mathematical logic, that rigorously defines the infinitesimals. Informally, an infinitesimal is an infinitely small number. Formally, x is said to be infinitesimal if and only if for all positive integers n one has xxx < 1/n. Let &>0 be a such infinitesimal number. The hyper-real number set is an extension of the real number set, which includes classes of infinite numbers and classes of infinitesimal numbers. Let’s consider the non-standard finite numbers 1+ = 1+&, where “1” is its standard part and “&” its non-standard part, …

Dialectics And The Dao: On Both, A And Non-A In Neutrosophy And Chinese Philosophy, Feng Liu, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This paper introduces readers to a new approach to dialectical logic: neutrosophy. Specifically it proposes a multi-valued logic in which the statement “both A and Non-A,” historically rejected as logically incoherent, is treated as meaningful. This unity of opposites constitutes both the objective world and the subjective world –a view with deep roots in Buddhism and Daoism, including the I-Ching. This leads in turn to the presentation of a framework for the development of a contradiction oriented learning philosophy inspired by the Later Trigrams of King Wen in the I-Ching. We show that although A and Non-A are logically inconsistent, …

An Almost Deep Degree, Peter Cholak, Marcia Groszek, Theodore Slaman

Dartmouth Scholarship

We show there is a non-recursive r.e. set A such that if W is any low r.e. set. then the join W ⊕ A is also low. That is. A is “almost deep”. This answers a question of Joekusch. The almost deep degrees form an definable ideal in the r.e. degrees (with jump.)

Modal Rules Are Co-Implications, Alexander Kurz

Engineering Faculty Articles and Research

In [13], it was shown that modal logic for coalgebras dualises—concerning definability— equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications:It is shown that a class of coalgebras is definable by modal rules iff it is closed under H (images) and Σ (disjoint unions). As a corollary the expressive power of rules of infinitary modal logic on Kripke frames is characterised.

Number, Infinity And Truth: Reflections On The Spiritual In Mathematics, James V. Rauff

Humanistic Mathematics Network Journal

No abstract provided.

Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.

State-Based Reconstructability Modeling For Decision Analysis, Michael S. Johnson, Martin Zwick

Complex Systems Faculty Publications and Presentations

Reconstructability analysis (RA) is a method for detecting and analyzing the structure of multivariate categorical data. Jones and his colleagues extended the original variable-based formulation of RA to encompass models defined in terms of system states (Jones 1982; Jones 1985; Jones 1985; Jones 1986; Jones 1989). In this paper, we demonstrate that Jones’ previous work comprises two separable ideas: the “g to k” transformation and state-based modeling. We relate the concept of state-based modeling to established variable-based RA methods (Klir 1985; Krippendorff 1986), and demonstrate that statebased modeling, when applied to event and decision tree models, is a valuable adjunct …

Definitions, Solved And Unsolved Problems, Conjectures, And Theorems In Number Theory And Geometry, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Florentin Smarandache, an American mathematician of Romanian descent has generated a vast variety of mathematical problems. Some problems are easy, others medium, but many are interesting or unsolved and this is the reason why the present book appears. Here, of course, there are problems from various types. Solving these problems is addictive like eating pumpkin seed: having once started, one cannot help doing it over and over again.

On Strongly N-Regular And Strongly Regular Rings, Huey Voon Chen

Student Works (2000-2009)

Let R be an associative ring with identity 1 (not equal to) 0. An element x E R is said to be right (or left) regular if there exists yin R such that x² y = x (or y.x² = x). If x is both left and right regular, then it is said to be strongly regular. The ring R is said to be strongly regular if every element of R is strongly regular. We say that x is a left -π-regular element if there exist an integer n > 0 and an element y E R such that yx n+1 …

A Reflection On The Word: Remembering The Word “Word” Is Reflexive, Paul Fjelstad, Ivan Ginchev

Humanistic Mathematics Network Journal

No abstract provided.

An Informal History Of Classical Rhetoric For Mathematicians (Plato And Aristotle), Phillip Keith, Sandra Z. Keith

Humanistic Mathematics Network Journal

No abstract provided.

Leibniz: His Philosophy And His Calculi, Eric Ditwiler

Humanistic Mathematics Network Journal

No abstract provided.

Prestructuring Neural Networks Via Extended Dependency Analysis With Application To Pattern Classification, George G. Lendaris, Thaddeus T. Shannon, Martin Zwick

Complex Systems Faculty Publications and Presentations

We consider the problem of matching domain-specific statistical structure to neural-network (NN) architecture. In past work we have considered this problem in the function approximation context; here we consider the pattern classification context. General Systems Methodology tools for finding problem-domain structure suffer exponential scaling of computation with respect to the number of variables considered. Therefore we introduce the use of Extended Dependency Analysis (EDA), which scales only polynomially in the number of variables, for the desired analysis. Based on EDA, we demonstrate a number of NN pre-structuring techniques applicable for building neural classifiers. An example is provided in which EDA …

(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz

Engineering Faculty Articles and Research

We present an extension of standard coalgebraic specification techniques for statebased systems which allows us to integrate constants and n-ary operations in a smooth way and, moreover, leads to a simplification of the coalgebraic structure of the models of a specification. The framework of (Ω,Ξ)-logic can be considered as the result of a translation of concepts of observational logic (cf. [9]) into the coalgebraic world. As a particular outcome we obtain the notion of an (Ω, Ξ)- structure and a sound and complete proof system for (first-order) observational properties of specifications.

Complexity Reduction In State-Based Modeling, Martin Zwick

Complex Systems Faculty Publications and Presentations

For a system described by a relation among qualitative variables (or quantitative variables "binned" into symbolic states), expressed either set-theoretically or as a multivariate joint probability distribution, complexity reduction (compression of representation) is normally achieved by modeling the system with projections of the overall relation. To illustrate, if ABCD is a four variable relation, then models ABC:BCD or AB:BC:CD:DA, specified by two triadic or four dyadic relations, respectively, represent simplifications of the ABCD relation. Simplifications which are lossless are always preferred over the original full relation, while simplifications which lose constraint are still preferred if the reduction of complexity more …

A Basis Theorem For Perfect Sets, Marcia J. Groszek, Theodore A. Slaman

Dartmouth Scholarship

We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element, answering a question of K. Prikry. This is a specific instance of a more general theorem giving a sufficient condition on a pair M ⊂ N of models of set theory implying that every perfect set in N has an element in N which is not in M.

Subiecte Posibile Pentru Examenul De Admitere În Liceu Şi Examenul De Capacitate (In Romanian), Florentin Smarandache, Constantin Coanda, Gheorghe Duta

Branch Mathematics and Statistics Faculty and Staff Publications

Prezenta lucrare" încearcă să pună la dispoziţia elevilor şi profesorilor instrumente de evaluare a cunoştinţelor la toate capitolele din actuala programă de matematică. " În evoluţia adolescenţi/or din ţara noastră etapa admiterii în liceu mobilizează eforturi şi emoţii cu totul speciale. 'Actuala lucrare se doreşte a fi un sfljtuitor permanent În perioada fierbinte dintre e.;wmenul de capacitate şi admiterea În liceu. Testele cuprinse in această culegere au un caracter complementar faţă de multe materiale scrise În vederea sprijinirii celor ce se pregătesc pentru astfel de examene şi se referă la intreaga materie cuprinsă În programele analitice de aritmetică, algebră şi …