The Simplest Axiom System for Plane Hyperbolic Geometry Revisited

Using the axiom system provided by Carsten Augat in [1], it is shown that the only 6-variable statement among the axioms of the axiom system for plane hyperbolic geometry (in Tarski’s language L _B≡), we had provided in [3], is superfluous. The resulting axiom system is the simplest possible one, in the sense that each axiom is a statement in prenex form about at most 5 points, and there is no axiom system consisting entirely of at most 4-variable statements.     

Axiomatizing geometric constructions

In this survey paper, we present several results linking quantifier-free axiomatizations of various Euclidean and hyperbolic geometries in languages without relation symbols to geometric constructibility theorems. Several fragments of Euclidean and hyperbolic geometries turn out to be naturally occurring only when we ask for the universal theory of the standard plane (Euclidean or hyperbolic), that can be expressed in a certain language containing only operation symbols standing for certain geometric constructions.     

The shortest possible length of the longest implicational axiom

A four-valued matrix is presented which validates all theorems of the implicational fragment, IF, of the classical sentential calculus in which at most two distinct sentence letters occur. The Wajsberg/Diamond-McKinsley Theorem for IF follows as a corollary: every complete set of axioms (with substitution and detachment as rules) must include at least one containing occurrences of three or more distinct sentence letters.Additionally, the matrix validates all IF theses built from nine or fewer occurrences of connectives and letters. So the classic result of Jaskovski for the full sentential calculus —that every complete axiom set must contain either two axioms of length at least nine or else one of length at least eleven—can be improved in the implicational case: every complete axiom set for IF must contain at least one axiom eleven or more characters long.Both results are best possible, and both apply as well to most subsystems of IF, e.g., the implicational fragments of the standard relevance logics, modal logics, the relatives of implicational intutionism, and logics in the ukasiewicz family.Earlier proofs of these results, utilizing a five-valued matrix built from the product matrix of C2 with itself via the method of [8], were obtained in 1988 while the author was a Visiting Research Fellow at the Automated Reasoning Project, Research School of Social Sciences, Australian National University, and were presented in [9]. The author owes thanks to the RSSS for creating the Project, and to the members of the Project generally for the stimulating atmosphere they created in turn, but especially to Robert K. Meyer for making the visit possible, and for many discussions over the years.     

Axiomatizations of Hyperbolic Geometry: A Comparison Based on Language and Quantifier Type Complexity

Hyperbolic geometry can be axiomatized using the notions of order andcongruence (as in Euclidean geometry) or using the notion of incidencealone (as in projective geometry). Although the incidence-based axiomatizationmay be considered simpler because it uses the single binary point-linerelation of incidence as a primitive notion, we show that it issyntactically more complex. The incidence-based formulation requires some axioms of the quantifier-type \forall\exists\forall, while the axiom system based on congruence and order can beformulated using only \forall\exists-axioms.     

The Simplest Axiom System for Hyperbolic Geometry Revisited,Again

Dependencies are identified in two recently proposed first-order axiom systems for plane hyperbolic geometry. Since the dependencies do not specifically concern hyperbolic geometry, our results yield two simpler axiom systems for absolute geometry.     

An Elementary System of Axioms for Euclidean Geometry Based on Symmetry Principles

In this article I develop an elementary system of axioms for Euclidean geometry. On one hand, the system is based on the symmetry principles which express our a priori ignorant approach to space: all places are the same to us (the homogeneity of space), all directions are the same to us (the isotropy of space) and all units of length we use to create geometric figures are the same to us (the scale invariance of space). On the other hand, through the process of algebraic simplification, this system of axioms directly provides the Weyl’s system of axioms for Euclidean geometry. The system of axioms, together with its a priori interpretation, offers new views to philosophy and pedagogy of mathematics: (1) it supports the thesis that Euclidean geometry is a priori, (2) it supports the thesis that in modern mathematics the Weyl’s system of axioms is dominant to the Euclid’s system because it reflects the a priori underlying symmetries, (3) it gives a new and promising approach to learn geometry which, through the Weyl’s system of axioms, leads from the essential geometric symmetry principles of the mathematical nature directly to modern mathematics.     

A Gabbay-Rule Free Axiomatization of T×W Validity

The semantical structures called T×W frames were introduced in (Thomason, 1984) for the Ockhamist temporal-modal language, _O, which consists of the usual propositional language augmented with the Priorean operators P and F and with a possibility operator . However, these structures are also suitable for interpreting an extended language, _SO, containing a further possibility operator ^s which expresses synchronism among possibly incompatible histories and which can thus be thought of as a cross-history simultaneity operator. In the present paper we provide an infinite set of axioms in _SO, which is shown to be strongly complete forT ×W-validity. Von Kutschera (1997) contains a finite axiomatization of T×W-validity which however makes use of the Gabbay Irreflexivity Rule (Gabbay, 1981). In order to avoid using this rule, the proof presented here develops a new technique to deal with reflexive maximal consistent sets in Henkin-style constructions.     

Determinism, Indeterminism And The Flow Of Time

A set of axioms implicitly defining the standard, though not instant-based but interval-based, time topology is used as a basis to build a temporal modal logic of events. The whole apparatus contains neither past, present, and future operators nor indexicals, but only B-series relations and modal operators interpreted in the standard way. Determinism and indeterminism are then introduced into the logic of events via corresponding axioms. It is shown that, if determinism and indeterminism are understood in accordance with their core meaning, the way in which they are formally introduced here represents the only right way to do this, given that we restrict ourselves to one real world and make no use of the many real worlds assumption. But then the result is that the very truth conditions for sentences about indeterministic events imply the existence of tensed truths, in spite of the fact that these conditions are formulated (in the indeterministic axiom) in terms of tenseless language. The tenseless theory of time implies determinism, while indeterminism requires the flow of time assumption.     

Decidability of General Extensional Mereology

The signature of the formal language of mereology contains only one binary predicate P which stands for the relation “being a part of”. Traditionally, P must be a partial ordering, that is, ${\forall{x}Pxx, \forall{x}\forall{y}((Pxy\land Pyx)\to x=y)}$ and ${\forall{x}\forall{y}\forall{z}((Pxy\land Pyz)\to Pxz))}$ are three basic mereological axioms. The best-known mereological theory is “general extensional mereology”, which is axiomatized by the three basic axioms plus the following axiom and axiom schema: (Strong Supplementation) ${\forall{x}\forall{y}(\neg Pyx\to \exists z(Pzy\land \neg Ozx))}$ , where Oxy means ${\exists z(Pzx\land Pzy)}$ , and (Fusion) ${\exists x\alpha \to \exists z\forall y(Oyz\leftrightarrow \exists x(\alpha \land Oyx))}$ , for any formula α where z and y do not occur free. In this paper, I will show that general extensional mereology is decidable, and will also point out that the decidability of the first-order approximation of the theory of complete Boolean algebras can be shown in the same way.     

Index

Visuospatial working memory (VSWM) and intuitive geometry were examined in two groups aged 11–13, one with children displaying symptoms of nonverbal learning disability (NLD; n?=?16), and the other, a control group without learning disabilities (n?=?16). The two groups were matched for general verbal abilities, age, gender, and socioeconomic level. The children were presented with simple storage and complex-span tasks involving VSWM and with the intuitive geometry task devised by Dehaene, Izard, Pica, and Spelke (2006 Dehaene, S., Izard, V., Pica, P. and Spelke, E. S. 2006. Core knowledge of geometry in an Amazonian indigene group. Science, 311: 381–384. [Crossref], [PubMed], [Web of Science ®] , [Google Scholar]). Results revealed that the two groups differed in the intuitive geometry task. Differences were particularly evident in Euclidean geometry and in geometrical transformations. Moreover, the performance of NLD children was worse than controls to a larger extent in complex-span than in simple storage tasks, and VSWM differences were able to account for group differences in geometry. Finally, a discriminant function analysis confirmed the crucial role of complex-span tasks involving VSWM in distinguishing between the two groups. Results are discussed with reference to the relationship between VSWM and mathematics difficulties in nonverbal learning disabilities.     

Conjunctions,Disjunctions and Lewisian Semantics for Counterfactuals

Consider the reasonable axioms of subjunctive conditionals (1) if p q ₁ and p q ₂ at some world, then p (q ₁ & q ₂) at that world, and (2) if p ₁ q and p ₂ q at some world, then (p ₁ ∨ p ₂) q at that world, where p q is the subjunctive conditional. I show that a Lewis-style semantics for subjunctive conditionals satisfies these axioms if and only if one makes a certain technical assumption about the closeness relation, an assumption that is probably false. I will then show how Lewisian semantics can be modified so as to assure (1) and (2) even when the technical assumption fails, and in fact in one sense the semantics actually becomes simpler then.     

A quasi-nonmetric method for multidimensional scaling VIA an extended euclidean model

An Extended Two-Way Euclidean Multidimensional Scaling (MDS) model which assumes both common and specific dimensions is described and contrasted with the standard (Two-Way) MDS model. In this Extended Two-Way Euclidean model then stimuli (or other objects) are assumed to be characterized by coordinates onR common dimensions. In addition each stimulus is assumed to have a dimension (or dimensions) specific to it alone. The overall distance between objecti and objectj then is defined as the square root of the ordinary squared Euclidean distance plus terms denoting the specificity of each object. The specificity,s _j , can be thought of as the sum of squares of coordinates on those dimensions specific to objecti, all of which have nonzero coordinatesonly for objecti. (In practice, we may think of there being just one such specific dimension for each object, as this situation is mathematically indistinguishable from the case in which there are more than one.)We further assume that _ij =F(d _ij ) +e _ij where _ij is the proximity value (e.g., similarity or dissimilarity) of objectsi andj,d _ij is the extended Euclidean distance defined above, whilee _ij is an error term assumed i.i.d.N(0, ²).F is assumed either a linear function (in the metric case) or a monotone spline of specified form (in the quasi-nonmetric case). A numerical procedure alternating a modified Newton-Raphson algorithm with an algorithm for fitting an optimal monotone spline (or linear function) is used to secure maximum likelihood estimates of the paramstatistics) can be used to test hypotheses about the number of common dimensions, and/or the existence of specific (in addition toR common) dimensions.This approach is illustrated with applications to both artificial data and real data on judged similarity of nations.     

Finitude and Hume’s Principle

The paper formulates and proves a strengthening of Freges Theorem, which states that axioms for second-order arithmetic are derivable in second-order logic from Humes Principle, which itself says that the number of Fs is the same as the number ofGs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. Finite Humes Principle also suffices for the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Freges definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed.     

Fractal Images of Formal Systems

Formal systems are standardly envisaged in terms of a grammar specifying well-formed formulae together with a set of axioms and rules. Derivations are ordered lists of formulae each of which is either an axiom or is generated from earlier items on the list by means of the rules of the system; the theorems of a formal system are simply those formulae for which there are derivations. Here we outline a set of alternative and explicitly visual ways of envisaging and analyzing at least simple formal systems using fractal patterns of infinite depth. Progressively deeper dimensions of such a fractal can be used to map increasingly complex wffs or increasingly complex value spaces, with tautologies, contradictions, and various forms of contingency coded in terms of color. This and related approaches, it turns out, offer not only visually immediate and geometrically intriguing representations of formal systems as a whole but also promising formal links (1) between standard systems and classical patterns in fractal geometry, (2) between quite different kinds of value spaces in classical and infinite-valued logics, and (3) between cellular automata and logic. It is hoped that pattern analysis of this kind may open possibilities for a geometrical approach to further questions within logic and metalogic.\looseness=-1     

On Bourbaki’s axiomatic system for set theory

In this paper we study the axiomatic system proposed by Bourbaki for the Theory of Sets in the Éléments de Mathématique. We begin by examining the role played by the sign \(\uptau \) in the framework of its formal logical theory and then we show that the system of axioms for set theory is equivalent to Zermelo–Fraenkel system with the axiom of choice but without the axiom of foundation. Moreover, we study Grothendieck’s proposal of adding to Bourbaki’s system the axiom of universes for the purpose of considering the theory of categories. In this regard, we make some historical and epistemological remarks that could explain the conservative attitude of the Group.     

Internal approach to external sets and universes

In this article we show how the universe of HST, Hrbaek set theory (a nonstandard set theory of external type, which includes, in particular, the ZFC Replacement and Separation schemata for all formulas in the language containing the membership and standardness predicates, and Saturation for standard size families of internal sets, but does not include the Power set axiom) admits a system of subuniverses which keep the Replacement, model Power set and Choice (in fact all of ZFC, with the exception of the Regularity axiom, which indeed is replaced by the Regularity over the internal subuniverse), and also keep as much of Saturation as it is necessary.This gives sufficient tools to develop the most complicated topics in nonstandard analysis, such as Loeb measures.Partially supported by AMS grants in 1993 – 1995 and DFG grants in 1994 – 1995. Robert Goldblatt     

Remarks on Gregory's “Actually” Operator

In this note we show that the classical modal technology of Sahlqvist formulas gives quick proofs of the completeness theorems in [8] (D. Gregory, Completeness and decidability results for some propositional modal logics containing actually operators, Journal of Philosophical Logic 30(1): 57–78, 2001) and vastly generalizes them. Moreover, as a corollary, interpolation theorems for the logics considered in [8] are obtained. We then compare Gregory's modal language enriched with an actually operator with the work of Arthur Prior now known under the name of hybrid logic. This analysis relates the actually axioms to standard hybrid axioms, yields the decidability results in [8], and provides a number of complexity results. Finally, we use a bisimulation argument to show that the hybrid language is strictly more expressive than Gregory's language.     

Locke's theory of classification

In §155 of his New Theory of Vision Berkeley explains that a hypothetical ‘unbodied spirit’ ‘cannot comprehend the manner wherein geometers describe a right line or circle’.1 ¹All references to Berkeley are from, A. A. Luce and T. E. Jessop (eds.), The Works of George Berkeley, Bishop of Cloyne (London: Thomas Nelson and Sons, Ltd., 1948) The following abbreviations are used: An Essay Towards A New Theory of Vision, section x = New Theory x; Philosophical Commentaries, entry x = Commentaries x; Part I of A Treatise concerning the Principles of Knowledge, section x = Principles x. All other references to Berkeley's works are of the form The Works of George Berkeley, Bishop of Cloyne, volume x, page y = Works, x, y. The reason for this, Berkeley continues, is that ‘the rule and compass with their use being things of which it is impossible he should have any notion.’ This reference to geometrical tools has led virtually all commentators to conclude that at least one reason why the unbodied spirit cannot have knowledge of plane geometry is because it cannot manipulate a ruler or a compass. In this article I will show that such an interpretation is flawed. I will instead argue that Berkeley's understanding of Euclidian geometry was based on Isaac Barrow's account of the foundations of geometry. On this view geometrical objects are conceived in terms of the idealized motion that generates the objects of geometry. Consequently, that what the unbodied spirit cannot do in this context is to form an idea of motion rather than being unable to handle geometrical tools.     

Graded modalities. I

We study a modal system ¯T, that extends the classical (prepositional) modal system T and whose language is provided with modal operators M inn (nN) to be interpreted, in the usual kripkean semantics, as there are more than n accessible worlds such that.... We find reasonable axioms for ¯T and we prove for it completeness, compactness and decidability theorems.The authors are very indebted to the referee for Ms consideration and appreciation of their work.     

Parsing as deduction: The use of knowledge of language

Hypothesising that the human parser is a specialized deductive device in which Universal Grammar and parameter settings are represented as axioms provides a model of how knowledge of language can be put to use. The approach is explained via a series of model deductive parsers for Government and Binding Theory, all of which use the same knowledge of language (i.e., underlying axiom system) but differ as to how they put this knowledge to use (i.e., they use different inference control strategies). They differ from most other GB parsers in that the axiom system directly reflects the modular structure of GB theory and makes full use of the multiple levels of reprepresentation posited in GB theory.