Łukasiewicz , supervaluations , and the future
نویسنده
چکیده
In this paper I consider an interpretation of future contingents which motivates a unification of a Łukasiewicz-style logic with the more classical supervaluational semantics. This in turn motivates a new non-classical logic modelling what is “made true by history up until now.” I give a simple Hilbertstyle proof theory, and a soundness and completeness argument for the proof theory with respect to the intended models.
منابع مشابه
/ Lukasiewicz, Supervaluations, And The Future
In this paper I consider an interpretation of future contingents which motivates a uniication of a Lukiasiewicz-style logic, and the more classical, supervaluational semantics. This in turn motivates a new non-classical logic modelling what is \made true by history up until now". I give a simple Hilbert-style proof theory, and a soundness and completeness argument for the proof theory with resp...
متن کاملŁukasiewicz Games
Boolean games provide a simple, compact, and theoretically attractive abstract model for studying multi-agent interactions in settings where players will act strategically in an attempt to achieve personal goals. A standard critique of Boolean games, however, is that the binary nature of goals (satisfied or unsatisfied) inevitably trivialises the nature of such strategic interactions: a player ...
متن کاملNonlinear Models of Neural and Genetic Network Dynamics: Natural Transformations of Łukasiewicz Logic LM-Algebras in a Łukasiewicz-Topos as Representations of Neural Network Development and Neoplastic Transformations
A categorical and Łukasiewicz-Topos framework for Łukasiewicz LM-Algebraic Logic models of nonlinear dynamics in complex functional systems such as neural networks, genomes and cell interactomes is proposed. Łukasiewicz Algebraic Logic models of genetic networks and signaling pathways in cells are formulated in terms of nonlinear dynamic systems with n-state components that allow for the genera...
متن کاملPrefix-Free Łukasiewicz Languages
Generalised Łukasiewicz languages are simply described languages having good information-theoretic properties. An especially desirable property is the one of being a prefix code. This paper addresses the question under which conditions a generalised Łukasiewicz language is a prefix code. Moreover, an upper bound on the delay of decipherability of a generalised Łukasiewicz language is derived.
متن کاملŁukasiewicz μ-calculus
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کامل