The well known Wiener-Kuratowski explicit definition of the ordered pair, which sets ⟨x, y⟩ = {{x}, {x, y}}, works well in many set theories but fails for those with classes which cannot be members of singletons. With the aid of the Axiom of Foundation, we propose a recursive definition of ordered pair which addresses this shortcoming and also naturally generalizes to ordered tuples of greater lenght. There are many advantages to the new definition, for it allows for (...) uniform definitions working equally well in a wide range of models for set theories. In ZFC and closely related theories, the of an ordered pair of two infinite sets under the new definition turns out to be equal to the maximum of the ranks of the sets. (shrink)

In this note, I present a modified semantic framework for the multi-valued paraconsistent logic LP, which allows for a straightforward preservation of a significant classical intuition about negation, namely that the negation operator reverses truth-value.

According to Frege, n=Kn, where n is any cardinal number and Kn is the class of all n-tuples. According to Von Neumann, n=Kpn, where Kpn is the class of all of n's predecessors. These analyses are prima facie incompatible with each other, given that Kn≠Kpn, for n>0. In the present paper it is shown that these analyses are in fact compatible with each other, for the reason that each analysis can and ultimately must be interpreted as being to the effect (...) that n=Cn, where Cn is the class of all ordered pairs <Kn#,Rn#>, where Kn# is an arbitrary class and Rn# is an arbitrary relation such that a class k has n-many members exactly if k bears Rn# to Kn#. (shrink)

In this paper, we generalize the ordered-pair semantics advanced by Matthew Clemens for the Logic of Paradox to n-tuple semantics, for each fixed n. Moreover, we show that the resulting semantics can accommodate not only LP, but also classical logic as well as strong Kleene logic depending on the set of designated values that one chooses. Building on the technical observations, we offer intuitively plausible readings for the semantics, and we also discuss some weaknesses of the original intuitive reading (...) advanced by Clemens. (shrink)

One of the most significant discoveries of early twentieth century mathematical logic was a workable definition of ‘ordered pair’ totally within set theory. Norbert Wiener, and independently Casimir Kuratowski, are usually credited with this discovery. A definition of ‘ordered pair’ held the key to the precise formulation of the notions of ‘relation’ and ‘function’ — both of which are probably indispensable for an understanding of the foundations of mathematics. The set-theoretic definition of ‘ordered pair’ thus turned out (...) to be a key victory for logicism, providing one admits set theory is logic. The definition also was instrumental in achieving the appearance of ontological economy — since it seemed only sets were needed — although this feature was emphasized only later. (shrink)

For the modern set theorist the empty set Ø, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building locks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and (...) Choice are broached in the formal elaboration of the ‘set of’f {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as amotif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski's recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all. (shrink)

The aim here is to describe how to complete the constructive logicist program, in the author’s book Anti-Realism and Logic, of deriving all the Peano-Dedekind postulates for arithmetic within a theory of natural numbers that also accounts for their applicability in counting finite collections of objects. The axioms still to be derived are those for addition and multiplication. Frege did not derive them in a fully explicit, conceptually illuminating way. Nor has any neo-Fregean done so.

In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. First, we show that first-order theories of finite signature that have functional non-surjective ordered pairing are definitionally equivalent to extensions in the same language of the basic theory of non-surjective ordered pairing. Second, we show that a first-order theory of finite signature is sequential (is a theory of sequences) (...) iff it is definitionally equivalent to an extension in the same language of a system of weak set theory called WS. (shrink)

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved in [Ben Yaacov, Pillay, Vassiliev - Lovely pairs of models] when $T^fP$ is a first order theory are proved for the general case: in particular $T^fP$ is simple and we characterise independence.

We prove that for every simple theory T there is a compact abstract theory T.

(1) This is Part 2 of the semantic theory I call TM. In Part 1, I developed TM as a theory in the analytic philosophy of language, in lexical semantics, and in the sociology of relating occasions of statement production and comprehension to formal and informal lexicographic conclusions about statements and lexical items – roughly, as showing how synchronic semantics is a sociological derivative of diachronic, person-relative acts of linguistic behavior. I included descriptions of new cognitive psychology experimental paradigms which (...) would allow us to precisely measure the two constituents of semantics – meaning and reference – both at the level of individual speech acts and at the level of societal convergences, i.e. at both the token and type levels. -/- (2) In the Introduction, I recapitulate the arguments of Part 1. The Introduction also develops some analytic philosophical and lexical semantics themes not discussed in Part 1. -/- (3) After the Introduction, I present neural TM (nTM) as a theory of the neural mechanisms and processes which give rise to these person/occasion-relative acts of linguistic behavior. I develop nTM at three levels, the first two of which describe linguistic/semantic functions independently of their cortical locations. At the first level, I describe individual word-to-word and word-to-object connections. At the second level, I describe the corresponding structuralist networks of which they are the individual components. At this level, I introduce some key linguistic concepts of TM – its graded meaning, reference, and generalization sets, and the types of statements which express various levels of word-to-word and word-to-object relationships among lexical items which, because of the constraints they impose on the use of those lexical items in statements we produce and comprehend, are concepts. This constitutes the second structural level of nTM. -/- (4) At the third level, I associate the non-localized structures of the previous levels with cortically located neural structures and with the fasciculi that connect them. I distinguish neural areas in which primary (phonetic) and secondary (orthographic) lexicons are stored in long-term memory. I also describe the embodied concepts which co-exist in the anterior temporal lobes with the images they lexicalize. These concepts are often said to name physical objects and their features, although what they in fact name are kinds of physical objects and features. I describe how conceptual constraints and referential constraints interact to channel our intentions to say how things are into statements which are semantically well-formed, and which consequently successfully communicate information. -/- (5) Following this presentation of nTM, I examine five prominent neural semantic theories. I point out what is wrong with each of them as far as their explanations of semantics are concerned, and I also indicate how nTM can replace the “semantic cores” of those theories. -/- (6) The two basic mistakes made by neuroscience semantic theories, as I will explain, are (i) that all but one of them regard semantics as a matter of the association of words with perceptual images, and of generalizations from those associations; and (ii) that they all rely on an unspecified set of neural structures which purportedly encode the meaning of concepts in abstraction from their phonological and orthographic forms. nTM maintains, in contrast, that there are no abstract neural representations of semantic content. Neural constraints on our linguistic behavior, especially on our ascriptive and co-ascriptive use of words, express the semantic constraints on those words which make them concepts. That is the semantic content of words. -/- (7) I next consider several results from neuroscience experimental data which have been given one interpretation by one or another of the standard neurosemantic theories, but to which nTM gives a different interpretation. I include several predictions which I have found neither confirmed nor disconfirmed in the experimental neuroscience literature. -/- (8) After a concluding section in which I summarize the major changes to neurosemantic theory introduced by TM, and the analytic philosophy of language and lexical semantics contexts within which TM is situated, there follows an appendix in which I discuss neural net AI, and make some recommendations for implementing nTM in silicon. (shrink)

A structure M is pregeometric if the algebraic closure is a pregeometry in all structures elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of Lascar U-rank a power of ω and d-minimal expansion of fields. Ultraproducts of pregeometric structures expanding an integral domain, while not pregeometric in general, do have a unique existential matroid. Generalising previous results by van den Dries, we define dense elementary pairs of structures expanding (...) an integral domain and with an existential matroid, and we show that the corresponding theories have natural completions, whose models also have a unique existential matroid. We also extend the above result to dense tuples of structures. (shrink)

This paper presents decomposition of the fourth-order Euler-type linear time-varying system as a commutative pair of two second-order Euler-type systems. All necessary and sufficient conditions for the decomposition are deployed to investigate the commutativity, sensitivity, and the effect of disturbance on the fourth-order LTVS. Some systems are commutative, and some are not commutative, while some are commutative under certain conditions. Based on this fact, the commutativity of fourth-order Euler-type LTVS is investigated by introducing the commutative requirements, theories, and conditions. The (...) fourth-order Euler-type LTVSs are investigated into commutative pairs of twice Euler-type second-order linear time-varying systems. The decomposition theories and conditions are derived, proved, and solved to simplify the use of commutativity for practical and industrial uses. Some fourth-order systems are sensitive toward change in initial conditions or parameters while others are not, and the effect due to disturbance also varies within systems. Furthermore, the stability and robustness of systems have so many issues. But we consider fourth-order Euler-type LTVS to observe, investigate, and tackle these issues. Lastly, the realization of fourth-order LTVS from cascaded two second-order systems can be laboratory experimented which is an open problem for future engineers to investigate. However, the theoretical results show a good agreement with the simulation results is considered in this work. Perhaps it might have unlimited physical applications in science and engineering as well as theoretical contribution. But beyond any reasonable doubt, the novelty is guaranteed because this study is the first of its kind that introduces the decomposition of the fourth-order Euler-type linear time-varying system as a commutative pair of two second-order Euler-type systems. Illustrative examples are presented to support the results. (shrink)

We prove that certain pairs of ordered structures are dependent. Among these structures are dense and tame pairs of o-minimal structures and further the real field with a multiplicative subgroup with the Mann property, regardless of whether it is dense or discrete.

When word pairs having a familiar order are sequentially flashed on a computer in their non-familiar order, , observers have a strong phenomenology of seeing them in familiar order . Reversal errors remained frequent even when participants obtained perceptual experience of reverse-display items by beginning with a block of longer-duration trials. A forced-choice order-detection procedure reduced but did not eliminate reversal errors, showing that “fast pairs” is a robust perceptual illusion. Even adjective + noun pairs showed reversal (...) errors, and reversal errors increased with the log frequency of the word pair, consistent with a strong role for statistical processing at the level of multi-word units. (shrink)

I consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He notes that only the (...) cardinalities of these sets matters, and that not all pairs of infinite sets determine the same logic. I use so-called two-cardinal theorems from model theory to investigate the space of logics and consequence relations determined by pairs of infinite sets, and show how to eliminate the assumption that worlds are individuals from Williamson’s argument. (shrink)

The transition semantics presented in Rumberg (J Log Lang Inf 25(1):77–108, 2016a) constitutes a fine-grained framework for modeling the interrelation of modality and time in branching time structures. In that framework, sentences of the transition language L_t are evaluated on transition structures at pairs consisting of a moment and a set of transitions. In this paper, we provide a class of first-order definable Kripke structures that preserves L_t-validity w.r.t. transition structures. As a consequence, for a certain fragment of L_t, (...) validity w.r.t. transition structures turns out to be axiomatizable. The result is then extended to the entire language L_t by means of a quite natural ‘Henkin move’, i.e. by relaxing the notion of validity to bundled structures. (shrink)

The transition semantics presented in Rumberg :77–108, 2016a) constitutes a fine-grained framework for modeling the interrelation of modality and time in branching time structures. In that framework, sentences of the transition language \ are evaluated on transition structures at pairs consisting of a moment and a set of transitions. In this paper, we provide a class of first-order definable Kripke structures that preserves \-validity w.r.t. transition structures. As a consequence, for a certain fragment of \, validity w.r.t. transition structures (...) turns out to be axiomatizable. The result is then extended to the entire language \ by means of a quite natural ‘Henkin move’, i.e. by relaxing the notion of validity to bundled structures. (shrink)

The purpose of this article is to present an educative experience carried out in a university context, in order to discuss of the ways that peer tutoring could contribute to the development of the pedagogical skills of future and novice teachers of French as a Foreign Language. The aforementioned case study lasted throughout an academic semester and involved undergraduate and graduate students.

Previous experiments have shown a serial-position effect (SPE) in paired-associate (PA) learning where the pairs contained stimuli pre- viously learned in serial order. The present experiment extended the number of pairs from 10 to 14. Pairs containing stimuli from terminal serial positions were learned with significantly fewer errors than pairs whose stimuli derived from central positions. The latter produced a dip in the PA error distribution suggesting the presence of sequential associations in SL between items occupying (...) central positions. (shrink)