Příspěvek přináší základní matematické zakotvení pojmů „teorie chaosu". Představuje klíčové vlastnosti modelů chaotického chování dynamického systému s ohledem na explanační a prediktivní sílu modelů. Z pozice filosofie vědy podrobuje analýze především reprezentační aspekty modelů chaotické dynamiky systému. Nejzajímavějším aspektem těchto modelů je přísné omezení jejich reprezentační úlohy s ohledem na splnění podmínky hyperbolicity nutné pro platnost stínového lemma.

This is a completely informal presentation of the ideas behind the diagonal lemma. One really can't see this important result from too many different angles. This one aims at getting the main idea across. (For the cognoscenti, it is in the spirit of Quine's treatment in terms of "appended to its own quotation".).

In this paper we propose to present from a new perspective some loci comunes of traditional logic. More exactly, we intend to show that some hypothetico-disjunctive inferences (i.e. the complex constructive dilemma, the complex destructive dilemma, the simple constructive dilemma, the simple destructive dilemma) and two hypothetico-categorical inferences (namely modus ponendo-ponens and modus tollendo-tollens) particularize two more abstract inferential structures: the constructive n-lemma and the destructive nlemma.

I prove that the Boolean Prime Ideal Theorem is equivalent, under some weak set-theoretic assumptions, to what I will call the Cut-for-Formulas to Cut-for-Sets Theorem: for a set F and a binary relation |- on Power(F), if |- is finitary, monotonic, and satisfies cut for formulas, then it also satisfies cut for sets. I deduce the CF/CS Theorem from the Ultrafilter Theorem twice; each proof uses a different order-theoretic variant of the Tukey- Teichmüller Lemma. I then discuss relationships between (...) various cut-conditions in the absence of finitariness or of monotonicity. (shrink)

Chains of causes appear when the existence of God is discussed. It is claimed by some that these chains must be finite and terminated by God. But these chains seem endless through our knowledge search. This endlessness for the physical reasons for any world event expresses the greatness and complexity of God’s creation and so the transcendence of God. So, only we can put our hands on physical reasons in an endless forage for knowledge. Yet, the endlessness of the physical (...) causes chains confirms the existence of God, and this is what our paper tries using Zorn’s lemma, an equivalent for one of the most celebrated axioms of mathematics, the Axiom of Choice. (shrink)

No False Lemmas (NFL) says: necessarily, S’s belief that p is knowledge only if it is not inferred from any falsehood. Its proponents argue that alleged counterexamples to NFL are really cases of knowledge despite falsehood, wherein the false premise is inessential to the inference; perhaps some nearby truth does the justificatory heavy-lifting. We argue that there can be cases of inferential knowledge from a blindspot premise. Given that in such cases the relevant falsehood is essential to the inference, one (...) cannot employ the knowledge despite falsehood strategy to defend NFL. We conclude by discussing how cases of knowledge from blindspots exemplify one way in which we can gain inferential knowledge defectively or non-ideally. (shrink)

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...) undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of point-free topology) (...) give rise to a profusion of topological belief operators that are compatible with the familiar topological knowledge operator. Thereby a canonical topological model for weak KB can be constructed. For this canonical model a truth lemma for the K and B holds such that a completeness theorem for KB can be proved in the familiar way. The second aim of this paper is to show that the topological interpretation of knowledge K comes along with a complete Heyting algebra of belief operators B that all fit the knowledge operator K in the sense that the pairs (K, B) satisfy all axioms of weak KB. This amounts to a pluralistic relation between knowledge and belief: Knowledge does not fully determine belief, rather it designs a conceptual space for belief operators where different (competing) belief operators coexist. (shrink)

A biologically unavoidable sequence is an infinite gender sequence which occurs in every gendered, infinite genealogical network satisfying certain tame conditions. We show that every eventually periodic sequence is biologically unavoidable (this generalizes König's Lemma), and we exhibit some biologically avoidable sequences. Finally we give an application of unavoidable sequences to cellular automata.

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (2005), and the dependence digraph by Beringer & Schindler (2015). Unlike the usual discussion about self-reference of paradoxes centering around Yablo's paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb's dependence relation. They are called 'locally finite paradoxes', satisfying that any sentence in these paradoxes can depend on finitely many sentences. I prove (...) that all locally finite paradoxes are self-referential in the sense that there is a directed cycle in their dependence digraphs. This paper also studies the 'circularity dependence' of paradoxes, which was introduced by Hsiung (2014). I prove that the locally finite paradoxes have circularity dependence in the sense that they are paradoxical only in the digraph containing a proper cycle. The proofs of the two results are based directly on König's infinity lemma. In contrast, this paper also shows that Yablo's paradox and its nested variant are non-self-referential, and neither McGee's paradox nor the omega-cycle liar paradox has circularity dependence. (shrink)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From ¬(p (...) ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we (...) show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators. (shrink)

The current literature on norms of inquiry features two families of norms: norms that focus on an inquirer’s ignorance and norms that focus on the question’s soundness. I argue that, given a factive conception of ignorance, it’s possible to derive a soundness-style norm from a version of the ignorance norm. A crucial lemma in the argument is that just as one can only be ignorant of a proposition if the proposition is true, so one can only be ignorant with (...) respect to a question if the question is sound. (shrink)

German idealism stems in large part from Fichte’s response to a dilemma involving the concepts of pantheism, freedom and time: either time is the form of the determination of modes of substance, as held by a pantheistic or ‘dogmatic’ person, or the form of acts generated by human freedom, as held by an idealistic person. Fichte solves the dilemma by refuting dogmatism and deducing time from idealism’s first principle. But his diagnosis is more portentous: by casting the lemmas in terms (...) of person-types, he unintentionally invites Schelling’s philosophical rethinking of personality. In his middle period, Schelling argues for the consistency of the concepts of pantheism, freedom and time, claiming that it depends on a ‘good’ as opposed to ‘evil’ personality. However, since on his view personality is an absolute or originally undecided capacity for good and evil, the trio’s consistency is entirely contingent. In §1, I trace Fichte’s resolution of the dilemma. In §§2-3, I reconstruct Schelling’s arguments for consistency from the Freiheitsschrift and Weltalter, texts written just a few years apart. In §4, I allay a Kantian worry that this consistency relies problematically on the liberty of indifference or Willkür. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic (...) with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as well: (...) to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)

The copy provided on ths site is a late draft. It provides a philosophical argument for the view that by and large it is morally wrong to buy shares in a company that is behaving badly unless you (if necessary acting together with others) are able and willing to prevent the misbehaviour. A key lemma in my argument concerns a chain of authorisation from the shareholders to the company's board to the CEO -- one in virtue of which shareholders (...) are ultimately responsible for major patterns of wrongdoing by the company. (shrink)

In this paper, I attempt to demonstrate that environmental virtue ethics (EVE) fails to provide sufficient justification for the hunting of nonhuman animals. In order to do this, I examine an EVE justification for the hunting of nonhuman animals and argue that it gives rise to the following dilemma: either EVE justifies the hunting of both human and nonhuman animals, or it justifies the hunting of neither. I then submit that the first lemma ought to be rejected as absurd (...) and, thus, that the second lemma ought to be embraced. (shrink)

We here make preliminary investigations into the model theory of DeMorgan logics. We demonstrate that Łoś's Theorem holds with respect to these logics and make some remarks about standard model-theoretic properties in such contexts. More concretely, as a case study we examine the fate of Cantor's Theorem that the classical theory of dense linear orderings without endpoints is $\aleph_{0}$-categorical, and we show that the taking of ultraproducts commutes with respect to previously established methods of constructing nonclassical structures, namely, Priest's Collapsing (...) Lemma and Dunn's Theorem in 3-Valued Logic. (shrink)

The paradox of rule-following that Saul Kripke finds in Wittgenstein’s Philosophical Investigations purports to show that words and thoughts have no content—that there is no intentionality. This paper refutes the paradox with a dilemma. Intentional states are posited in rational explanations, which use propositional attitudes to explain actions and thoughts. Depending on which of the two plausible views of rational explanation is right, either: the paradox is mistaken about the a priori requirements for content; or, a fatal flaw in content (...) ascription alleged by the paradox is not a flaw at all, but a necessary component of the proper method of propositional-attitude ascription. On either lemma, rational explanation defuses the paradox. (shrink)

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it nevertheless leaves two (...) questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

In his “A new argument for evidentialism” (Shah, Philos Q 56(225): 481–498, 2006 ), Nishi Shah argues that the best explanation of a feature of deliberation whether to believe that p which he calls transparency entails that only evidence can be reason to believe that p. I show that his argument fails because a crucial lemma that his argument appeals to cannot be supported without assuming evidentialism to be true in the first place.

Purpose. This article is devoted to the case study of relevant linguacultural stereotypes of the particular organization’s managerial culture and based on corresponding results the inquiry of the discourses formation features associated with the lexico-semantic meanings dispersion of (Foucault). -/- Methods and Procedure of Research. Top managers of a large Ukrainian enterprise (67 respondents) were asked to arbitrarily describe the following concepts – “manager”, “subordinate”, “managerial style”. Each concept was differentiated according to the principle of the lexico-semantic opposition (“productive – (...) counterproductive”). The obtained set of texts was lemmatized and a frequency analysis of the lemmas was carried out as well. Collocations were also evaluated, in particular, repeated n-grams were identified. In the further analysis were used all detected n-grams and those lemmas, the observed frequencies of which statistically significantly exceeded the expected ones. -/- Results. Discourse formation features are determined by the paradigmatic relations of lexico-semantic units (words) and their semantic linear compatibility. The paradigmatic dispersion of a discourse is represented by the quality of connections between lemmas according to the criterion of the paradigm types to be found. Also informative is the assessment of the lemmas number (granularity of the discourse) and the spectrum diversity of paradigmatic relations in the discourse. These parameters reflect the properties of homogeneity/complexity of discourse meanings dispersion. The syntagmatic dissemination of discourse is manifested by the features of the words semantic linear interrelationship in each n-gram. This parameter reflects the quality of rationalizations (verbal-logical chains) associated with the corresponding discourses. The length of n-grams (the number of words) is also indicative – the higher n, the more differentiated the discourse is and vice versa. Matching the words semantics in n-grams with lemmas allows one to draw a conclusion regarding the internal consistency (integration) of the discourse. -/- Conclusions. Psycholinguistic tools can be effectively used in an organizational phenomena study. In particular, the frequency analysis of lemmas, their lexico-semantic evaluation, as well as the qualitative analysis of n-grams in the problem-targeted texts of respondents allows one to solve applied research issues related to the assessment of current linguacultural trends in an organization and understanding their possible causes. Managerial culture, as a linguacultural phenomenon, is represented by a set of stably reproduced discourses in the process of the organization’s functioning. At the same time, discourses are constituted by the dispersion of meanings (words), which is being realized in two linguistic dimensions – paradigmatic and syntagmatic ones. (shrink)

(1) In the first part of this paper, I review Chomsky's meandering journey from the formalism/mentalism of Syntactic Structures, through several methodological positions, to the minimalist theory of his latest work. Infected with mentalism from first to last, each and every position vitiates Chomsky's repeated claims that his theories will provide useful guidance to later theories in such fields as cognitive psychology and cognitive neuroscience. With the guidance of his insights, he claims, psychologists and neuroscientists will be able to avoid (...) costly dead-end lines of research. -/- (2) This never happened. As I have shown, this never could have happened. (See Johnston, 2018). What has happened, instead, is that current neurolinguistic research (with the arguable exception of the now-dated Lemma Model of Willem Levelt) proceeds without reference to Chomsky. It also wholeheartedly rejects the mentalism of the associated Language of Thought theory of Jerry Fodor. (See Johnston, 2018). -/- (3) I make this argument in the first part of this paper. I would also like to point out that most of my argument was developed in 1972, when I was a graduate student. I know of no other sustained criticisms of Chomsky at that time, and certainly none along the lines I had developed back then. -/- (4) In the second part of this paper, I present my own account of the methodology of science. When I was a graduate student, philosophy of science was dominated by an attempt to describe a methodology common to all the specific sciences, i.e. Hempel’s deductive-nomological model. These days, Hempel’s emphasis on the methodological unity of science has been rejected by such “dis-unity” philosophers of science as Ian Hacking, Patrick Suppes and Nancy Cartwright (see Cat, 2021). -/- (5) I view this change as the swing of a pendulum or, to change the metaphor, a journey from one end point of a continuum to another. As the level of abstraction at which one tries to describe scientific method is raised, the descriptions become increasingly general. Whether or not unity-of-science theories become so general as to be vacuous, is ultimately a subjective judgment. And so I expect that philosophers will eventually become tired of increasingly specific “close to the workbench” descriptions of how scientists work, and begin to turn back to methodological “big pictures”, finding in them powerful abstractions rather than empty irrelevancies. -/- (6) In the second part of this paper, I present my own account of the methodology of science, which I would situate somewhere between the “unity” and “dis-unity” accounts. However, I am not a scientist. My own views about scientific method have three origins: -/- (6a) my work as a graduate student from 1966 until I passed my comprehensive exams in 1973 (at a different university); -/- (6b) reading every issue of Scientific American from 1972 until nearly 2000, (at which point I continued to read it only sporadically, since I concluded that, around that time, it had evolved from a serious science magazine to a popular science magazine); and -/- (6c) my three-year immersion in the cognitive neuroscience of language after I retired, based on repeated study of and note-taking for (Banesh & Compton, 2018), (Kemmerer, 2015), several other books and, finally, numerous articles not hidden behind a paywall. -/- So, as always with my writings: caveat emptor. (shrink)

A suprise may occur if we use a similar strategy to the Liar's paradox to mathematically formalize "This sentence does not contain the symbol X".

Metaphysical graphical structuralism is the view that at some fundamental level the world is a mathematical graph of nodes and edges. Randall Dipert has advanced a graphical structuralist theory of fundamental particulars and Alexander Bird has advanced a graphical structuralist theory of fundamental properties. David Oderberg has posed a powerful challenge to graphical structuralism: that it entails the absurd inexistence of the world or the absurd cessation of all change. In this paper I defend graphical structuralism. A sharper formulation, some (...) theorems about such structures, and careful attention to the interaction of metaphysical and mathematical features, shows that the absurdities depend on assumptions that are not essential to the view and brings to light a surprising fact about the necessary structure of fundamental properties. (shrink)

The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we prove (...) that the recursive extension of \sqema\ succeeds on the class of `recursive formulae'. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds. (shrink)

Notions such as śūnyatā, catuṣkoṭi, and Indra's net, which figure prominently in Buddhist philosophy, are difficult to readily accommodate within our ordinary thinking about everyday objects. Famous Buddhist scholar Nāgārjuna considered two levels of reality: one called conventional reality, and the other ultimate reality. Within this framework, śūnyatā refers to the claim that at the ultimate level objects are devoid of essence or "intrinsic properties", but are interdependent by virtue of their relations to other objects. Catuṣkoṭi refers to the claim (...) that four truth values, including contradiction, are admissible in reasoning. Indra's net refers to the claim that every part of a whole is reflective of the whole. Here we present category theoretic constructions that are reminiscent of these Buddhist concepts. The universal mapping property definition of mathematical objects, wherein objects of a universe of discourse are defined not in terms of their content, but in terms of their relations to all objects of the universe is reminiscent of śūnyatā. The objective logic of perception, with perception modeled as [a category of] two sequential processes (sensation followed by interpretation), and with its truth value object of four truth values, is reminiscent of the Buddhist logic of catuṣkoṭi. The category of categories, wherein every category has a subcategory of sets with zero structure within which every category can be modeled, is reminiscent of Indra's net. Our thorough elaboration of the parallels between Buddhist philosophy and category theory can facilitate better understanding of Buddhist philosophy, and bring out the broader philosophical import of category theory beyond mathematics. (shrink)

This brief paper provides documentation to a computer program for analysis of Spinoza's Ethics. The program explodes an entity in the Ethics either (1) forward to the tree of all propositions that depend upon the entity or (2) backwards to the tree terminating at the axioms, definitions, lemmas or propositions on which the proof of the entity depend. The paper gives instructions to download and implement the program in Windows.

This dissertation is centrally concerned with exploring obituaries as repositories of values. Obituaries are a publicly-available natural language source that are variably written for members of communities that are wide (nation- level) and narrow (city-level, or at the level of specific groups therein). Because they are explicitly summative, limited in size, and written for consumption by a public audience, obituaries may be expected to express concisely the aspects of their subjects’ lives that the authors (often family members living in the (...) same communities) found most salient or worthy of featuring. 140,599 obituaries nested in 832 newspapers from across the USA were scraped with permission from Legacy.com, an obituaries publisher. Obituaries were coded for the age at death and gender (female/male) of the deceased using automated algorithms. For each publishing newspaper, county-level median income, educational achievement (operationalized as percent of the population with a Bachelor’s degree or higher), and race and ethnicity were averaged across counties, weighting by population size. A Neo4J graph database was constructed using WordNet and the University of South Florida Free Association Norms datasets. Each word in each obituary inthe corpus was lemmatized. The shortest path through the WordNet graph from each lemma to 30 Schwartz value prototype words published by Bardi, Calogero, and Mullen (2008) was then recorded. From these path lengths, a new measure, “word-by-hop,” was calculated for each Schwartz value to reflect the relative lexical distance between each obituary and that Schwartz value. Of the Schwartz values, Power, Conformity, and Security were most indicated in the corpus, while Universalism, Hedonism, and Stimulation were least indicated. A series of seven two-level regression models suggested that, across Schwartz values, newspaper community accounted for the greatest amount of word-by-hop variability in the corpus. The best-fitting model indicated a small, negative effect of female status across Schwartz values. Unexpectedly, Hedonism and Conformity, which had conceptually opposite prototype words, were highly correlated, possibly indicating that obituary authors “compensate” for describing the deceased in a hedonistic way by concurrently emphasizing restraint. Future research could usefully further expand word-by-hop and incorporate individual-level covariates that match the newspaper-level covariates used here. (shrink)

J. Schauder introduced the notion of basis in a Banach space in 1927. If a Banach space has a basis then it is also separable. The problem whether every separable Banach space has a Schauder basis appeared for the first time in 1931 in Banach's book "Theory of Linear Operations". If a Banach space has a Schauder basis it also has the approximation property. A Banach space X has the approximation property if for every Banach space Y the finite rank (...) operators are dense in the closed subspace of all compact operators from Y to X. Both problems were solved in the negative in 1972 by Per Enflo. His proof was almost immediately simplified by A. M. Davie, who using a probabilistic lemma constructed a separable closed subspace of l_inifnity without the approximation property. In this thesis we present some of the equivalent properties to the approximation property due to A. Grothendieck, and we make a detailed exposition of the proof by A. M. Davie. (shrink)

In Zettel, Wittgenstein considered a modified version of Cantor’s diagonal argument. According to Wittgenstein, Cantor’s number, different with other numbers, is defined based on a countable set. If Cantor’s number belongs to the countable set, the definition of Cantor’s number become incomplete. Therefore, Cantor’s number is not a number at all in this context. We can see some examples in the form of recursive functions. The definition "f(a)=f(a)" can not decide anything about the value of f(a). The definiton is incomplete. (...) The definition of "f(a)=1+f(a)" can not decide anything about the value of f(a) too. The definiton is incomplete.<br><br>According to Wittgenstein, the contradiction, in Cantor's proof, originates from the hidden presumption that the definition of Cantor’s number is complete. The contradiction shows that the definition of Cantor’s number is incomplete. <br><br>According to Wittgenstein’s analysis, Cantor’s diagonal argument is invalid. But different with Intuitionistic analysis, Wittgenstein did not reject other parts of classical mathematics. Wittgenstein did not reject definitions using self-reference, but showed that this kind of definitions is incomplete.<br><br>Based on Thomson’s diagonal lemma, there is a close relation between a majority of paradoxes and Cantor’s diagonal argument. Therefore, Wittgenstein’s analysis on Cantor’s diagonal argument can be applied to provide a unified solution to paradoxes. (shrink)

Philosophe japonais polyglotte au savoir encyclopédique, Yamauchi Tokuryū est à n’en point douter l’un des auteurs les moins étudiés de l’école de Kyōto. La présente étude vient corriger ce qui ne constitue rien d’autre qu’un accident de l’histoire, tant l’ampleur du projet philosophique de Yamauchi est à même de susciter l’intérêt du philosophe, du savant et de l’amateur cultivé. La démarche de ce penseur japonais, disciple de Nishida Kitarō, est remarquable en ce qu’il chercha à proposer un dépassement englobant de (...) ce qu’il nomme, d’une part, la « logique du logos » – qui figurait déjà chez Aristote et se structure autour des principes d’identité, de contradiction et du tiers exclu – et, d’autre part, la « logique du lemme » – méthode d’appréhension intuitive des étants qui, née en Inde, serait d’inspiration essentiellement bouddhique. Cette étude, dans laquelle les conceptions bouddhiques qui traversent le propos de Yamauchi sont explicitées, est essentiellement consacrée à l’analyse de ses deux essais les plus importants Logos et lemme (1974) et Philosophie de la latence (1993). Le lecteur y rencontrera une discussion tant de la logique aristotélicienne que d’un régime de logicité tel que le tétralemme, tant du coeur des philosophies européennes que de celui des pensées bouddhiques. Il y rencontrera en outre une discussion de l’idée de néant, de la causalité et de la question du fondement de l’être, nourrie de conceptions bouddhiques telles que la « coproduction conditionnée » (pratītya-samutpāda) et la « latence » (anuśaya). (shrink)

Here, the author tries to build the structure of the Theory of computation based on considering time as a fuzzy concept. In fact, there are reasons to consider time as a fuzzy concept. In this article, the author doesn’t go to this side but note that Brower and Husserl views on the concept of time were similar [8]. Some reasons have been given for it in [3]. Throughout this article, the author presents the Theory of Computation with Fuzzy Time. Given (...) the classic definition of Turing Machine, the concept of Time is modified to Fuzzy time. This new term calls as Theory TC* [2] and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new theory, some of the major obstacles and unsolved problems have been solved [2]. It should be noted that in this article, the writer considers fuzzy number associated to instants of time as a symmetric one. The point about the symmetry is in the proof of Lemma 3, although it is generalizable. In particular, the new classes of complexity Theory, P*, NP*, BPP* in the TC* analogues to the definitions of P, NP, BPP defines as their natural alternative definition. Here, we will see P*≠ NP*, P*= BPP*. Finally, we have Theorem 4. (shrink)

Here, we try to build the structure of a Theory of computation based on considering time as a fuzzy concept. Actually, there are some reasons to consider time as a fuzzy concept. In this article, we don’t go to this side but we remind that Brower and Husserl ideas about the concept of time were similar [14]. Throughout this article, we present the Theory of Computation with Fuzzy Time. Considering the classical definition of Turing Machine we change and modify the (...) concept of Time to Fuzzy time. We call this new Theory TC* and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new Theory some of the major obstacles and unsolved problems are solved. It should be mentioned that in this article, we consider fuzzy number a symmetric one. The point about the symmetry is in the proof of Lemma 3, although we are able to generalize it. More specifically, we define the new classes of complexity Theory, P*, NP*, BPP* in TC* analogues to the definitions P, NP, BPP as their natural substituted definition. We show P*≠ NP*, P*= BPP*. Finally, we have Theorem 4, P≠NP . (shrink)