98,584 research outputs found
Bounds of some real (complex) solution of a finite system of polynomial equations with rational coefficients
We discuss two conjectures.
(I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such
that
\forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}}
\forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1)
\forall i,j,k \in {1,...,n} (x_i+x_j=x_k \Rightarrow y_i+y_j=y_k)
\forall i,j,k \in {1,...,n} (x_i \cdot x_j=x_k \Rightarrow y_i \cdot y_j=y_k)
(II) Let G be an additive subgroup of C. Then for each x_1,...,x_n \in G
there exist y_1,...,y_n \in G \cap Q such that
\forall i \in {1,...,n} |y_i| \leq 2^{n-1}
\forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1)
\forall i,j,k \in {1,...,n} (x_i+x_j=x_k \Rightarrow y_i+y_j=y_k)Comment: LaTeX2e, 28 pages, a shortened and revised version will appear in
Mathematical Logic Quarterly 56 (2010), no.2, under the title ``Two
conjectures on the arithmetic in R and C'
The Transfer Principle holds for definable nonstandard models under Countable Choice
Herzberg F. The Transfer Principle holds for definable nonstandard models under Countable Choice. Center for Mathematical Economics Working Papers. Vol 560. Bielefeld: Center for Mathematical Economics; 2016.Łos’s theorem for (bounded) D-ultrapowers, D being the
ultrafilter introduced by Kanovei and Shelah [Journal of Symbolic Logic,
69(1):159–164, 2004], can be established within Zermelo–Fraenkel set
theory plus Countable Choice (). Thus, the Transfer Principle
for both Kanovei and Shelah’s definable nonstandard model of the reals
and Herzberg’s definable nonstandard enlargement of the superstructure
over the reals [Mathematical Logic Quarterly, 54(2):167–175; 54(6):666–
667, 2008] can be shown in . This establishes a conjecture by
Mikhail Katz [personal communication]
Computability and analysis: the legacy of Alan Turing
We discuss the legacy of Alan Turing and his impact on computability and
analysis.Comment: 49 page
Algebraic functions in quasiprimal algebras
Artículo finalmente aceptado y publicado en: Algebraic functions in quasiprimal algebras; Wiley VCH Verlag; Mathematical Logic Quarterly; 60; 3; 4-2014; 154-160. ISSN 0942-5616A function is algebraic on an algebra A if it can be implicitly defined by a system of equations on A. In this note we give a semantic characterization for algebraic functions on quasiprimal algebras. This characterization is applied to obtain necessary and sufficient conditions for a quasiprimal algebra A to have every one of its algebraic functions be a term function. We also apply our results to particular algebras such as finite fields and monadic algebras.submittedVersionFil: Vaggione, Diego. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina.Fil: Campercholi, Miguel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina.Matemática Pur
Greek and Roman Logic
In ancient philosophy, there is no discipline called “logic” in the contemporary sense of “the study of formally valid arguments.” Rather, once a subfield of philosophy comes to be called “logic,” namely in Hellenistic philosophy, the field includes (among other things) epistemology, normative epistemology, philosophy of language, the theory of truth, and what we call logic today. This entry aims to examine ancient theorizing that makes contact with the contemporary conception. Thus, we will here emphasize the theories of the “syllogism” in the Aristotelian and Stoic traditions. However, because the context in which these theories were developed and discussed were deeply epistemological in nature, we will also include references to the areas of epistemological theorizing that bear directly on theories of the syllogism, particularly concerning “demonstration.” Similarly, we will include literature that discusses the principles governing logic and the components that make up arguments, which are topics that might now fall under the headings of philosophy of logic or non-classical logic. This includes discussions of problems and paradoxes that connect to contemporary logic and which historically spurred developments of logical method. For example, there is great interest among ancient philosophers in the question of whether all statements have truth-values. Relevant themes here include future contingents, paradoxes of vagueness, and semantic paradoxes like the liar. We also include discussion of the paradoxes of the infinite for similar reasons, since solutions have introduced sophisticated tools of logical analysis and there are a range of related, modern philosophical concerns about the application of some logical principles in infinite domains. Our criterion excludes, however, many of the themes that Hellenistic philosophers consider part of logic, in particular, it excludes epistemology and metaphysical questions about truth. Ancient philosophers do not write treatises “On Logic,” where the topic would be what today counts as logic. Instead, arguments and theories that count as “logic” by our criterion are found in a wide range of texts. For the most part, our entry follows chronology, tracing ancient logic from its beginnings to Late Antiquity. However, some themes are discussed in several eras of ancient logic; ancient logicians engage closely with each other’s views. Accordingly, relevant publications address several authors and periods in conjunction. These contributions are listed in three thematic sections at the end of our entry
The End of Mystery
Tim travels back in time and tries to kill his grandfather before his father was born. Tim fails. But why? Lewis's response was to cite "coincidences": Tim is the unlucky subject of gun jammings, banana peels, sudden changes of heart, and so on. A number of challenges have been raised against Lewis's response. The latest of these focuses on explanation. This paper diagnoses the source of this new disgruntlement and offers an alternative explanation for Tim's failure, one that Lewis would not have liked. The explanation is an obvious one but controversial, so it is defended against all the objections that can be mustered
- …