Specification acquisition in the system design process has been improved since the middle of the 1980s when the upper CASE tools appeared. On the contrary the quality of requirement acquisition in the upper processes of system design has not been enhanced as much as specification acquisition. Understanding the user's requirements is indispensable as one of the basic conditions for building systems that can really satisfy users.This article discusses obtaining requirement knowledge, in terms of human-centred design. The focus is on the (...) process of requirement acquisition, where there is room for one to make full use of human knowledge in a dynamic manner. (shrink)
The aim of this paper is to examine the role of imagination in environmental ethics and introduce an imaginative dimension as an essential part of environmental ethics. Imagination constitutes a basic condition for ethical thinking and action. Matters of environmental ethics have revealed the indispensable role of imagination in ethics. I’ll advance an imagination-based environmental ethics by developing Hans Jonas’ ethical thought. From his viewpoint, various effects of our action on nature and future generations, generally out of our sight, have (...) become an ethical concern. This necessitates the exercise of imagination because we must “imagine” those distant effects to act in an environmentally responsible way. Jonas’ “heuristics of fear” is an imaginative approach necessary for responsible action. Further, I reinterpret the role of imagination as motivating our “will to know.” In conclusion, I suggest the importance of environmental education as cultivating ecological imagination from the standpoint of environmental ethics. (shrink)
Modern technology has radically altered the conditions for human action, endowing us with tremendous power to affect the future. Patterns of action that appear positive in their short-term effects must sometimes be judged unsustainable. Hans Jonas and Thomas Berry are among those who emphasize the necessity of transforming ethics in light of these considerations. In a Whiteheadian framework, this needed transformation is rooted in the nature of things.
In this paper, we introduce systems of nonstandard second-order arithmetic which are conservative extensions of systems of second-order arithmetic. Within these systems, we do reverse mathematics for nonstandard analysis, and we can import techniques of nonstandard analysis into analysis in weak systems of second-order arithmetic. Then, we apply nonstandard techniques to a version of Riemannʼs mapping theorem, and show several different versions of Riemannʼs mapping theorem.
We define a new theory of concatenation WTC which is much weaker than Grzegorczyk's well-known theory TC. We prove that WTC is mutually interpretable with the weak theory of arithmetic R. The latter is, in a technical sense, much weaker than Robinson's arithmetic Q, but still essentially undecidable. Hence, as a corollary, WTC is also essentially undecidable.
We pursue the idea that predicate logic is a “fibred algebra” while propositional logic is a single algebra; in the context of intuitionism, this algebraic understanding of predicate logic goes back to Lawvere, in particular his concept of hyperdoctrine. Here, we aim at demonstrating that the notion of monad-relativised hyperdoctrines, which are what we call fibred algebras, yields algebraisations of a wide variety of predicate logics. More specifically, we discuss a typed, first-order version of the non-commutative Full Lambek calculus, which (...) has extensively been studied in the past few decades, functioning as a unifying language for different sorts of logical systems (classical, intuitionistic, linear, fuzzy, relevant, etc.). Through the concept of Full Lambek hyperdoctrines, we establish both generic and set-theoretical completeness results for any extension of the base system; the latter arises from a dual adjunction, and is relevant to the tripos-to-topos construction and quantale-valued sets. Furthermore, we give a hyperdoctrinal account of Girard’s and Gödel’s translation. (shrink)
It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.
Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convexity algebra as a pointfree convexity space. There are two notions of a point for convexity algebra: one is a chain-prime meet-complete filter and the other is a maximal meet-complete filter. In this paper we show the following: the former notion of a point induces a dual equivalence between the category of “spatial” convexity algebras and the category of “sober” convexity spaces as well as a dual (...) adjunction between the category of convexity algebras and the category of convexity spaces; the latter notion of point induces a dual equivalence between the category of “m-spatial” convexity algebras and the category of “m-sober” convexity spaces. We finally argue that the former notion of a point is more useful than the latter one from a category theoretic point of view and that the former notion of a point actually represents a polytope and the latter notion of a point properly represents a point. We also remark on the close relationships between pointfree convex geometry and domain theory. (shrink)
This research was partially supported by Grant-in-Aid for Scientific Research, Ministry of Education, Science and Culture of Japan Mathematics Subject Classification: 03E05 -->. Following Carr's study on diagonal operations and normal filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} in [2], several weakenings of normality have been investigated. One of them is to consider normal filters without \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-completeness, for example, see DiPrisco-Uzcategui [3]. The other (...) is weakening normality itself while keeping \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-completeness such as in Mignone [10] and Shioya [11]. We take the second one so that all filters are assumed to be \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-complete. In Sect. 1 a hierarchy of filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} is presented which corresponds to the length of diagonal intersections under which the filters are closed. It turns out that many ranks exist between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $FSF_{\kappa\lambda}$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $CF_{\kappa\lambda}$\end{document}. We consider seminormal ideals in Sect. 2 and determine the minimal seminormal ideal extending Johnson's result in [6]. Its precise descripti on changes according to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $cf$\end{document} although we can write it in a single form as well. We also prove that a nonnormal seminormal ideal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $I\supset NS_{\kappa\lambda}$\end{document} exists if and only if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\lambda$\end{document} is regular. (shrink)
.A type of subtlety for Pκλ called “strongly subtle” is introduced to show almost ineffability is consistencywise stronger than Shelah property. The following are also shown: is strongly subtle” has rather strong consequences. The ideal is not strongly subtle} is not λ-saturated, and completely ineffable ideal is not precipitous. In case that λ<κ=2λ, almost λ-ineffability coincides with λ-ineffability. It is not provable that κ is λ<κ-ineffable whenever κ is λ-ineffable.
This paper explores relationships between many-valued logic and fuzzy topology from the viewpoint of duality theory. We first show a fuzzy topological duality for the algebras of Łukasiewicz n -valued logic with truth constants, which generalizes Stone duality for Boolean algebras to the n -valued case via fuzzy topology. Then, based on this duality, we show a fuzzy topological duality for the algebras of modal Łukasiewicz n -valued logic with truth constants, which generalizes Jónsson-Tarski duality for modal algebras to the (...) n -valued case via fuzzy topology. We emphasize that fuzzy topological spaces naturally arise as spectrums of algebras of many-valued logics. (shrink)
There are still on-going debates on what exactly is wrong with Prior’s pathological “tonk.” In this article I argue, on the basis of categorical inferentialism, that two notions of inconsistency ought to be distinguished in an appropriate account of tonk; logic with tonk is inconsistent as the theory of propositions, and it is due to the fallacy of equivocation; in contrast to this diagnosis of the Prior’s tonk problem, nothing is actually wrong with tonk if logic is viewed as the (...) theory of proofs rather than propositions, and tonk perfectly makes sense in terms of the identity of proofs. Indeed, there is fully complete semantics of proofs for tonk, which allows us to link the Prior’s old philosophical idea with contemporary issues at the interface of categorical logic, computer science, and quantum physics, and thereby to expose commonalities between the laws of Reason and the laws of Nature, which are what logic and physics are respectively about. I conclude the article by articulating the ideas of categorical logical positivism and pluralistic unified science as its goal, including the unification of realist and antirealist conceptions of meaning by virtue of the categorical logical basis of metaphysics. (shrink)
Wittgenstein’s philosophy of mathematics is often devalued due to its peculiar features, especially its radical departure from any of standard positions in foundations of mathematics, such as logicism, intuitionism, and formalism. We first contrast Wittgenstein’s finitism with Hilbert’s finitism, arguing that Wittgenstein’s is perspicuous or surveyable finitism whereas Hilbert’s is transcendental finitism. We then further elucidate Wittgenstein’s philosophy by explicating his natural history view of logic and mathematics, which is tightly linked with the so-called rule-following problem and Kripkenstein’s paradox, yielding (...) vital implications to the nature of mathematical understanding, and to the nature of the certainty and objectivity of mathematical truth. Since the incompleteness theorems, foundations of mathematics have mostly lost their philosophical driving force, and anti-foundationalism has become prevalent and pervasive. Yet new foundations have nevertheless emerged and come into the scene, namely categorical foundations. We articulate the foundational significance of category theory by explicating three forms of foundations, i.e., global foundations, local foundations, and conceptual foundations. And we explore the possibility of categorical unified science qua pluralistic unified science, arguing for the categorical unity of science on both mathematical and philosophical grounds. We then turn to an issue in conceptual foundations of mathematics, namely the nature of the concept of space. We elucidate Wittgenstein’s intensional conception of space in relation to Brouwer’s theory of space continua and to the modern conception of space as point-free structure in category theory and algebraic geometry. We finally give a bird’s-eye view of mathematical philosophy from a Wittgensteinian perspective, and further sheds new light on Wittgenstein’s constructive structuralism and his view of incompleteness and contradictions in mathematics. (shrink)
We investigate the partition property of ${\mathcal{P}_{\kappa}\lambda}$ . Main results of this paper are as follows: (1) If λ is the least cardinal greater than κ such that ${\mathcal{P}_{\kappa}\lambda}$ carries a (λ κ , 2)-distributive normal ideal without the partition property, then λ is ${\Pi^1_n}$ -indescribable for all n < ω but not ${\Pi^2_1}$ -indescribable. (2) If cf(λ) ≥ κ, then every ineffable subset of ${\mathcal{P}_{\kappa}\lambda}$ has the partition property. (3) If cf(λ) ≥ κ, then the completely ineffable ideal over (...) ${\mathcal{P}_{\kappa}\lambda}$ has the partition property. (shrink)
Wittgenstein’s philosophy of mathematics is often devalued due to its peculiar features, especially its radical departure from any of standard positions in foundations of mathematics, such as logicism, intuitionism, and formalism. We first contrast Wittgenstein’s finitism with Hilbert’s finitism, arguing that Wittgenstein’s is perspicuous or surveyable finitism whereas Hilbert’s is transcendental finitism. We then further elucidate Wittgenstein’s philosophy by explicating his natural history view of logic and mathematics, which is tightly linked with the so-called rule-following problem and Kripkenstein’s paradox, yielding (...) vital implications to the nature of mathematical understanding, and to the nature of the certainty and objectivity of mathematical truth. Since the incompleteness theorems, foundations of mathematics have mostly lost their philosophical driving force, and anti-foundationalism has become prevalent and pervasive. Yet new foundations have nevertheless emerged and come into the scene, namely categorical foundations. We articulate the foundational significance of category theory by explicating three forms of foundations, i.e., global foundations, local foundations, and conceptual foundations. And we explore the possibility of categorical unified science qua pluralistic unified science, arguing for the categorical unity of science on both mathematical and philosophical grounds. We then turn to an issue in conceptual foundations of mathematics, namely the nature of the concept of space. We elucidate Wittgenstein’s intensional conception of space in relation to Brouwer’s theory of space continua and to the modern conception of space as point-free structure in category theory and algebraic geometry. We finally give a bird’s-eye view of mathematical philosophy from a Wittgensteinian perspective, and further sheds new light on Wittgenstein’s constructive structuralism and his view of incompleteness and contradictions in mathematics. (shrink)
The frame problem is a fundamental challenge in AI, and the Lucas-Penrose argument is supposed to show a limitation of AI if it is successful at all. Here we discuss both of them from a unified Gödelian point of view. We give an informational reformulation of the frame problem, which turns out to be tightly intertwined with the nature of Gödelian incompleteness in the sense that they both hinge upon the finitarity condition of agents or systems, without which their alleged (...) limitations can readily be overcome, and that they can both be seen as instances of the fundamental discrepancy between finitary beings and infinitary reality. We then revisit the Lucas-Penrose argument, elaborating a version of it which indicates the impossibility of information physics or the computational theory of the universe. It turns out through a finer analysis that if the Lucas-Penrose argument is accepted then information physics is impossible too; the possibility of AI or the computational theory of the mind is thus linked with the possibility of information physics or the computational theory of the universe. We finally reconsider the Penrose’s Quantum Mind Thesis in light of recent advances in quantum modelling of cognition, giving a structural reformulation of it and thereby shedding new light on what is problematic in the Quantum Mind Thesis. Overall, we consider it promising to link the computational theory of the mind with the computational theory of the universe; their integration would allow us to go beyond the Cartesian dualism, giving, in particular, an incarnation of Chalmers’ double-aspect theory of information. (shrink)
Lawvere hyperdoctrines give categorical algebraic semantics for intuitionistic predicate logic. Here we extend the hyperdoctrinal semantics to a broad variety of substructural predicate logics over the Typed Full Lambek Calculus, verifying their completeness with respect to the extended hyperdoctrinal semantics. This yields uniform hyperdoctrinal completeness results for numerous logics such as different types of relevant predicate logics and beyond, which are new results on their own; i.e., we give uniform categorical semantics for a broad variety of non-classical predicate logics. And (...) we introduce an analogue of Lawvere–Tierney topology and cotopology in the hyperdoctrinal setting, which gives a unifying perspective on different logical translations, in particular allowing for a uniform treatment of Girard’s exponential translation between linear and intuitionistic logics and of Kolmogorov’s double negation translation between intuitionistic and classical logics. In the hyerdoctrinal conception, type theories are categories, logics over type theories are functors, and logical translations between them, then, are natural transformations, in particular Lawvere–Tierney topologies and cotopologies on hyperdoctrines. The view of logical translations as hyperdoctrinal Lawvere–Tierney topologies and cotopologies has not been elucidated before, and may be seen as a novel contribution of the present work. From a broader perspective, this work may be regarded as taking first steps towards interplay between algebraic and categorical logics; it is, technically, a combination of substructural algebraic logic and hyperdoctrinal categorical logic, as the hyperdoctrinal completeness theorem is shown via the integration of the Lindenbaum–Tarski algebra construction with the syntactic category construction. As such this work lays a foundation for further interactions between algebraic and categorical logics. (shrink)
Although Wittgenstein’s influence on logic and foundations of mathematics is well recognized, nonetheless, his legacy concerning other sciences is much less elucidated, and in this article we aim at shedding new light on physics, artificial intelligence, and cognitive science from a Wittgensteinian perspective. We focus upon three issues amongst other things: the Chosmky versus Norvig debate on the nature of language; a Neo-Kantian parallelism between Bohr’s philosophy of physics and Hilbert’s philosophy of mathematics; the relationships between cognitive contextuality and physical (...) contextuality as shown by recent Bell-type results. The Chosmky versus Norvig debate may be seen as a battle between Wittgenstein’s earlier and later conceptions of meaning, i.e., picture theory and use theory. From a Wittgensteinian point of view, quantum physics may be seen as a physical version of the Linguistic Turn. The parallelism between Bohr’s philosophy of classical concepts and Hilbert’s philosophy of finitism builds upon transcendental philosophy in the Kantian tradition, both Bohr and Hilbert having been influenced by Neo-Kantian thinkers, such as Hertz, whose sign theory is actually a common root of Wittgenstein’s picture theory and Hilbert’s axiomatics. Wittgenstein is considered a root of contextualism in contemporary philosophy. Contextuality has different manifestations in physics and cognitive science, and contextuality studies across the sciences are rapidly developing in cutting-edge research. We elucidate both analogies and disanalogies between contextuality of reality and contextuality of reason in terms of the nature of probabilities involved. In passing, we also give a reformulation of Penrose’s quantum mind thesis. (shrink)
Although Wittgenstein’s influence on logic and foundations of mathematics is well recognized, nonetheless, his legacy concerning other sciences is much less elucidated, and in this article we aim at shedding new light on physics, artificial intelligence, and cognitive science from a Wittgensteinian perspective. We focus upon three issues amongst other things: the Chosmky versus Norvig debate on the nature of language; a Neo-Kantian parallelism between Bohr’s philosophy of physics and Hilbert’s philosophy of mathematics; the relationships between cognitive contextuality and physical (...) contextuality as shown by recent Bell-type results. The Chosmky versus Norvig debate may be seen as a battle between Wittgenstein’s earlier and later conceptions of meaning, i.e., picture theory and use theory. From a Wittgensteinian point of view, quantum physics may be seen as a physical version of the Linguistic Turn. The parallelism between Bohr’s philosophy of classical concepts and Hilbert’s philosophy of finitism builds upon transcendental philosophy in the Kantian tradition, both Bohr and Hilbert having been influenced by Neo-Kantian thinkers, such as Hertz, whose sign theory is actually a common root of Wittgenstein’s picture theory and Hilbert’s axiomatics. Wittgenstein is considered a root of contextualism in contemporary philosophy. Contextuality has different manifestations in physics and cognitive science, and contextuality studies across the sciences are rapidly developing in cutting-edge research. We elucidate both analogies and disanalogies between contextuality of reality and contextuality of reason in terms of the nature of probabilities involved. In passing, we also give a reformulation of Penrose’s quantum mind thesis. (shrink)
We study the distributivity of the bounded ideal on Pkλ and answer negatively to a question of Johnson in [13]. The size of non-normal ideals with the partition property is also studied.
We consider weak theories of concatenation, that is, theories for strings or texts. We prove that the theory of concatenation WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, which is a weak subtheory of Grzegorczyk’s theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document}, is a minimal essentially undecidable theory, that is, the theory WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document} is essentially undecidable and if one omits an axiom scheme from WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, then the resulting theory is no longer essentially undecidable. Moreover, we give a positive answer to Grzegorczyk and Zdanowski’s conjecture that ‘The theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document} is a minimal essentially undecidable theory’. For the alternative theories WTC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}}$$\end{document} and TC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}}$$\end{document} which have the empty string, we also prove that the each theory without the neutrality of ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon}$$\end{document} is to be such a theory too. (shrink)
