In the paper, certain rational postulates for protocols describing real communicating are introduced.These rational postulates, on the one hand, allow assigning a certain typology of real systems of interactions, which is consistent with the reality of epistemic argumentation in systems of communicating, and on the other one – defining rules of using argumentation in real situations. Moreover, the presented postulates for protocols characterize information networks and administering knowledge in real interactivity systems. Due to the epistemic character of the considerations, the (...) problem undertaken in the paper concerns working out fundamental assumptions that refer to building of epistemic logics. They allow establishing the correctness of the discourse defined by rational postulates of protocols of real communication. In the context of the presented problem there are the following two research questions distinguished: 1) How do we determine the rule of building of real dynamic epistemic logics? and 2) How should we define semantics for these logics? Within the framework of considerations relating to the research questions asked, certain epistemic operators, relativized to types of communicating, are introduced. Basic logical relations between using these operators are established for these operators. The relations are presented by a diagram called the square of epis temic operators. On the basis of these logical relations some axioms for real dynamic epistemic logics are presented. The semantics of real dynamic epistem ic logics is extended by the methods of lower and upper approximation of formula evaluating. This allows defining ‘approximation Kripke models’. The results of conceptualization of knowledge on real premises of epistemic argum entation presented in this paper can be applied to rhetoric in real systems of interaction. (shrink)

In the first section of this paper we show that i Π1 ≡ W⌝⌝lΠ1 and that a Kripke model which decides bounded formulas forces iΠ1 if and only if the union of the worlds in any path in it satisflies IΠ1. In particular, the union of the worlds in any path of a Kripke model of HA models IΠ1. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Πm-formulas (...) in a linear Kripke model deciding Δ0-formulas it is necessary and sufficient that the model be Σm-elementary. This implies that if a linear Kripke model forces PEMprenex, then it forces PEM. We also show that, for each n ≥ 1, iΦn does not prove ℋ(IΠn's are Burr's fragments of HA. (shrink)

Kripke models, interpreted realistically, have difficulty making sense of the thesis that there might have existed things that do not in fact exist, since a Kripke model in which this thesis is true requires a model structure in which there are possible worlds with domains that contain things that do not exist. This paper argues that we can use Kripke models as representational devices that allow us to give a realistic interpretation of a modal language. (...) The method of doing this is sketched, with the help of an analogy with a Galilean relativist theory of spatial properties and relations. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

Kripke’s main argument against descriptivism is rooted in a category error that confuses statements about the world with statements about models of the world. It is only because of the ambiguity introduced by the fact that a single sentence can frame two different propositions, one necessary and the other a posteriori, that one reaches the mistaken conclusion that there can be necessary a posteriori truths. This ambiguity from language was carried over into modal logic by Kripke. However, we (...) must consider the two different propositions (1) and (2) separately. Doing so reveals that a given proposition is either necessary and a priori or contingent and a posteriori. It cannot be both. (shrink)

Some years ago, Hidding et al. suggest that the emergence of intricate and pervasive weblike structure of the Universe on Megaparsec scales can be approximated by a well-known equation from fluid mechanics, the Burgers’ equation. The solution to this equation can be obtained from a geometrical formalism. The resulting Adhesion formalism provides deep insight into the dynamics and topology of the Cosmic Web. It uncovers a direct connection between the conditions in the very early Universe and the complex spatial patterns (...) that emerged out of these under the influence of gravity. In the present paper, we describe a cellular automaton model of the Burgers’ equation, which can be investigated via a fast computer simulation. In the end, this suggests a Cellular Automata Adhesion Model of the Universe. (shrink)

Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example, intuitionistic logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the basic logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models could provide a semantics for fuzzy logics. For each axiom of the basic fuzzy logic, necessary and sufficient conditions are sought for Kripke frames/models which satisfy (...) them. It turns out that the only fuzzy logics (logics containing the basic fuzzy logic) which are sound and complete with respect to a class of Kripke frames/models are the extensions of the Gödel logic (or the super-intuitionistic logic of Dummett); indeed this logic is sound and strongly complete with respect to reflexive, transitive and connected (linear) Kripke frames (with persistent satisfaction relations). This provides a semantic characterization for the Gödel logic among (propositional) fuzzy logics. (shrink)

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

Everyone knows what David Lewis' possible worlds are, what role they play in his account of possibility and necessity, and Saul Kripke's criticisms. But what, instead, are Kripke's possible worlds, and what role do they play in his account of possibility and necessity? The answers are not so obvious. Recently, it has even been claimed that, contrary to what is standardly assumed, Kripke's approach to modality has not always been consistently metaphysical. In particular, an interpretation of the (...) famous passage in the preface to Naming and Necessity with Kripke's discussion of the dice example has been put forward, according to which he purports there to clarify the modal notions in terms of that of possible world, model-theoretically construed, in a way which is reminiscent of Carnap's. In this paper, I shall point out some internal difficulties of this interpretation, and offer a different one, according to which in the dice passage Kripke is trying, consistently with his metaphysical approach, to legitimize the technically useful notion of possible world starting from modal notions, to be accounted for in another way (arguably, in an essentialistic framework). My final goal, however, will be philosophical elucidation rather than mere exegesis. Indeed, I am interested in shedding some light on what possible worlds might possibly be, if something like Kripke's metaphysical approach is on the right track. (shrink)

The extensions of Goodman’s ‘grue’ predicate and Kripke’s ‘quus’ are constructed from the extensions of more familiar terms via a reinterpretation that permutes assignments of reference. Since this manoeuvre is at the heart of Putnam’s model-theoretic and permutation arguments against metaphysical realism (‘Putnam’s Paradox’), both Goodman’s New Riddle of Induction and the paradox about meaning that Kripke attributes to Wittgenstein are instances of Putnam’s. Evidence cannot selectively confirm the green-hypothesis and disconfirm the grue-hypothesis, because the theory of (...) which the green-hypothesis is a part has an unintended model in which the grue-hypothesis is equally confirmed; and there are no meaning-facts that determine reference, because the objects referred to by the referring terms of any language or set of intentional mental states are permutable in a way that is consistent with the truth-values of all other sentences in that language or beliefs in that set. The upshot is that the three paradoxes need to be solved in a unified way. (shrink)

Building upon Nancy Cartwright's discussion of models in How the Laws of Physics Lie, this paper addresses solid state research in transition metal oxides. Historical analysis reveals that in this domain models function both as the culmination of phenomenology and the commencement of theoretical explanation. Those solid state chemists who concentrate on the description of phenomena pertinent to specific elements or compounds assess models according to different standards than those who seek explanation grounded in approximate applications of the Schroedinger equation. (...) Accurate accounts of scientific debate in this field must include both perspectives. (shrink)

Hájek (Erkenntnis 70(2):211–235, 2009) argues that probabilities cannot be the limits of relative frequencies in counterfactual infinite sequences. I argue for a different understanding of these limits, drawing on Norton’s (Philos Sci 79(2):207–232, 2012) distinction between approximations (inexact descriptions of a target) and idealizations (separate models that bear analogies to the target). Then, I adapt Hájek’s arguments to this new context. These arguments provide excellent reasons not to use hypothetical frequencies as idealizations, but no reason not to use them as (...) approximations. (shrink)

In this paper, we present an expansion of one of the well-known classical inventory management models, which is the static model of inventory management without a deficit and for a single substance, based on the neutrosophic logic, where we provide through this study a basis for dealing with all data, whether specific or undefined in the field of inventory management, as it provides safe environment to manage inventory without running into deficit , and give us an approximate ideal volume (...) of inventory. Since the ideal size is affected by the rate of demand for inventory, we present in this paper a study of the rate of demand for inventory when it is not precisely refined, and we find that the indeterminate values of the demand rate cannot be ignored, because they actually affect determining the ideal size of inventory and calculating its costs, thus affecting on the efficiency of the facility and achieve great profits for it. (shrink)

To study climate change, scientists employ computer models, which approximate target systems with various levels of skill. Given the imperfection of climate models, how do scientists use simulations to generate knowledge about the causes of observed climate change? Addressing a similar question in the context of biological modelling, Levins (1966) proposed an account grounded in robustness analysis. Recent philosophical discussions dispute the confirmatory power of robustness, raising the question of how the results of computer modelling studies contribute to the body (...) of evidence supporting hypotheses about climate change. Expanding on Staley’s (2004) distinction between evidential strength and security, and Lloyd’s (2015) argument connecting variety-of-evidence inferences and robustness analysis, I address this question with respect to recent challenges to the epistemology robustness analysis. Applying this epistemology to case studies of climate change, I argue that, despite imperfections in climate models, and epistemic constraints on variety-of-evidence reasoning and robustness analysis, this framework accounts for the strength and security of evidence supporting climatological inferences, including the finding that global warming is occurring and its primary causes are anthropogenic. (shrink)

In this work we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingale representation in case of discrete time and an application of the result for semi-continuous market model are also given.

We present a cosmological model (RL+) that offers exact predictions for the Hubble constant, the cosmological constant, the total energy density of the universe, and a curvature that matches current observational constraints. The model predicts a cosmological constant energy density that constitutes approximately 64% of the total energy budget, in agreement with current estimates from the standard LCDM model. Furthermore, the model addresses several longstanding cosmological problems—namely, the problem of infinite initial density, the coincidence problem, and (...) the flatness problem—all with the introduction of a single temporal parameter. (shrink)

This paper updates (2017) a previously-presented* model of models, which can be used to clarify discussion and analysis in a variety of disputes and debates, since many such discussions hinge on displaying or implying models about how things are related. Knowing about models does not itself supply any new information about our world, but it might help us to recognize when and how information is being conveyed on these matters, or where possibly it is being obscured. If a claim (...) P is expressed in the context of a certain model, a disagreement about P may actually not be about whether the underlying model is accurate; it could reflect misunderstandings about the model’s assumptions or conventions. Also, in practice, constructed models are rarely fully elaborated for every detail, so misunderstandings can arise from apparent “gaps” in the model. In that case, developing and considering complementary versions of models can sometimes clarify ambiguities. Following the main analysis are several extended Case examples to illustrate the wide applicability of the models approach, for clarifying, if not necessarily “resolving”, numerous debates and issues. For example, a famous “counter example” by Nelson Goodman to a logical model proposed by Carnap is shown to be not as deal-breaking as presumed historically, if only plausible complementary models had been explored. And models sometimes presented as competing in Artificial Intelligence research— “Declarative” versus “Procedural”—can instead be viewed as good examples of “complementary” models. Also reconsidered in this light are some well-known, competing positions, by Russell, Strawson, and Kripke, in the literature regarding names, pointing, definite descriptions and “using” sentences, and so on. All these concepts are locatable within the presently proposed models analysis. Questions such as where “truth” resides (whether in sentences or in uses of sentences) are not settled in this paper; yet, practical questions about how testable claims about the world can be expressed by models are clarified. _* Original version presented at a University of Waterloo Philosophy Colloquium 1984. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists (...) of linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Philosophers interested in the theoretical consequences of predictive processing often assume that predictive processing is an inferentialist and representationalist theory of cognition. More specifically, they assume that predictive processing revolves around approximated Bayesian inferences drawn by inverting a generative model. Generative models, in turn, are said to be structural representations: representational vehicles that represent their targets by being structurally similar to them. Here, I challenge this assumption, claiming that, at present, it lacks an adequate justification. I examine the only (...) argument offered to establish that generative models are structural representations, and argue that it does not substantiate the desired conclusion. Having so done, I consider a number of alternative arguments aimed at showing that the relevant structural similarity obtains, and argue that all these arguments are unconvincing for a variety of reasons. I then conclude the paper by briefly highlighting three themes that might be relevant for further investigation on the matter. (shrink)

Evolutionary anthropologists and archaeologists have been considerably successful in modelling the cumulative evolution of culture, of technological skills and knowledge in particular. Recently, one of these models has been introduced in the philosophy of science by De Cruz and De Smedt (Philos Stud 157:411–429, 2012), in an attempt to demonstrate that scientists may collectively come to hold more truth-approximating beliefs, despite the cognitive biases which they individually are known to be subject to. Here we identify a major shortcoming in that (...) attempt: De Cruz & De Smedt’s mathematical model makes one particularly strong tractability assumption that causes the model to largely miss its target (namely, truth accumulation in science), and that moreover conflicts with empirical observations. The second, more constructive part of the paper presents an alternative, agent-based model, which allows one to much better examine the conditions for scientific progress and decline. (shrink)

In this work, we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingaỉe representation in the case of discrete time and an application of obtained result for semi-continous market model are given.

A lot has been written on solutions to the semantic paradoxes, but very little on the topic of general theories of paradoxicality. The reason for this, we believe, is that it is not easy to disentangle a solution to the paradoxes from a specific conception of what those paradoxes consist in. This paper goes some way towards remedying this situation. We first address the question of what one should expect from an account of paradoxicality. We then present one conception of (...) paradoxicality that has been offered in the literature: the fixed-point conception. According to this conception, a statement is paradoxical if it cannot obtain a classical truth-value at any fixed-point model. In order to assess this proposal rigorously we provide a non-metalinguistic characterization of paradoxicality and we evaluate whether the resulting account satisfies a number of reasonable desiderata. (shrink)

We present a technique for the analysis of pattern formation by a class of models for the formation of ocular dominance stripes in the striate cortex of some mammals. The method, which employs the adiabatic approximation to derive a set of ordinary differential equations for patterning modes, has been successfully applied to reaction-diffusion models for striped patterns [1]. Models of ocular dominance stripes have been studied [2,3] by computation, or by linearization of the model equations. These techniques do (...) not provide a rationale for the origin of the stripes. We show here that stripe formation is a non-linear property of the models. Our analysis indicates that stripe selection is closely linked to a property in the dynamics of the models which arises from a symmetry between ipsilateral and contralateral synapses to the visual cortex of a given hemisphere. (shrink)

We call for a new philosophical conception of models in physics. Some standard conceptions take models to be useful approximations to theorems, that are the chief means to test theories. Hence the heuristics of model building is dictated by the requirements and practice of theory-testing. In this paper we argue that a theory-driven view of models can not account for common procedures used by scientists to model phenomena. We illustrate this thesis with a case study: the construction of (...) one of the first comprehensive model of superconductivity by London brothers in 1934. Instead of theory-driven view of models, we suggest a phenomenologically-driven one. (shrink)

Dans Naming and Necessity, Saul Kripke a proposé une théorie causale de la référence selon laquelle un nom se réfère à un objet en vertu d'une connexion causale avec l'objet, médiatisée par les communautés de locuteurs. Il déclare également que les noms propres, contrairement à la plupart des descriptions, sont des désignations rigides (le nom propre fait référence à l'objet nommé dans tout monde possible dans lequel l'objet existe)Les idées de Naming and Necessity ont évolué au fil du temps, (...) se développant sur la base de recherches formelles antérieures en théorie des modèles pour la logique modale, basées sur le principe leibnizien d'identité des indiscernables. DOI: 10.13140/RG.2.2.23511.09122 . (shrink)

According to [Bayesian] models” in cognitive neuroscience, says a recent textbook, “the human mind behaves like a capable data scientist”. Do they? That is to say, do such model show we are rational? I argue that Bayesian models of cognition, perhaps surprisingly, do not and indeed cannot, show that we are Bayesian-rational. The key reason is that such models appeal to approximations, a fact that carries significant implications. After outlining the argument, I critique two responses, seen in recent cognitive (...) neuroscience. One says that the mind can be seen as approximately Bayes-rational, while the other reconceives norms of rationality. (shrink)

The chromodielectric soliton model is Lorentz and chirally invariant. It has been demonstrated to exhibit dynamical chiral symmetry breaking and spatial confinement in the locally uniform approximation. We here study the full nonlocal quark self-energy in a color-dielectric medium modeled by a two-parameter Fermi function. Here color confinement is manifest. The self-energy thus obtained is used to calculate quark wave functions in the medium which, in turn, are used to calculate the nucleon and pion masses in the one-gluon-exchange (...) approximation. The nucleon mass is fixed to its empirical value using scaling arguments; the pion mass (for massless current quarks) turns out to be small but nonzero, depending on the model parameters. (shrink)

$${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets (...) of all the sentences that can jointly be valued as true we introduced the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enabled us to characterize referential contradictions, i.e., sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke-style fixed-point characterization of groundedness was offered, and complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) fixed points were put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of $$\mathcal{F}$$ -systems. We showed the relation between local conglomerates and admissible sets of arguments and argued about the usefulness of the concept for the argumentation theory. (shrink)

The LIBOR Market Model has become one of the most popular models for pricing interest rate products. It is commonly believed that Monte-Carlo simulation is the only viable method available for the LIBOR Market Model. In this article, however, we propose a lattice approach to price interest rate products within the LIBOR Market Model by introducing a shifted forward measure and several novel fast drift approximation methods. This model should achieve the best performance without losing (...) much accuracy. Moreover, the calibration is almost automatic and it is simple and easy to implement. Adding this model to the valuation toolkit is actually quite useful; especially for risk management or in the case there is a need for a quick turnaround. (shrink)

The data analyzed in this paper are part of the results described in Bueno et al. (2000). Three cytogenetics endpoints were analyzed in three populations of a species of wild rodent – Akodon montensis – living in an industrial, an agricultural, and a preservation area at the Itajaí Valley, State of Santa Catarina, Brazil. The polychromatic/normochromatic ratio, the mitotic index, and the frequency of micronucleated polychromatic erythrocites were used in an attempt to establish a genotoxic profile of each area. It (...) was assumed that the three populations were in the same conditions with respect to the influence of confounding factors such as animal age, health, nutrition status, presence of pathogens, and intra- and inter-populational genetic variability. Therefore, any differences found in the endpoints analyzed could be attributed to the external agents present in each area. The statistical models used in this paper are mixtures of negative-binomials and Poisson variables. The Poisson variables are used as approximations of binomials for rare events. The mixing distributions are beta densities. The statistical analyzes are under the bayesian perspective, as opposed to the frequentist ones often considered in the literature, as for instance in Bueno et al. (2000). (shrink)

This study considers the problem of using approximate way for realizing the neural supervisor for nonlinear multivariable systems. The Nonlinear Autoregressive-Moving Average (NARMA) model is an exact transformation of the input-output behavior of finite-dimensional nonlinear discrete time dynamical organization in a hoodlum of the equilibrium state. However, it is not convenient for intention of adaptive control using neural networks due to its nonlinear dependence on the control input. Hence, quite often, approximate technique are used for realizing the neural supervisor (...) to overcome computational complexity. In this study, we introduce two classes of ideal which are approximations to the NARMA model and which are linear in the control input, namely NARMA-L1 and NARMA-L2. The latter fact substantially simplifies both the theoretical breakdown as well as the practical request of the controller. Extensive imitation studies have shown that the neural controller designed using the proposed approximate models perform very well and in dozens situation even better than an approximate controller designed using the exact NARMA Model. In view of their mathematical tractability as well as their fate in simulation studies, a matter is made in this study that such approximate input-output paragon warrants a detailed study in their own right. (shrink)

Timothy Williamson has shown that the B axiom for 'definitely' (α → Δ¬Δ¬α) guarantees that if a sentence is second-order vague in a Kripke model, it is nth order vague for every n. More recently, Anna Mahtani has argued that Williamson's epistemicist theory of vagueness does not support the B axiom, and conjectured that if we consider models in which the “radius of accessibility” varies between different points, we will be able to find sentences that are nth-order vague (...) but (n+1)th-order precise, for any n. This paper bolsters Mahtani's argument, shows her conjecture to be true, and shows that imposing certain further natural constraints on "variable radius" models does not change the situation. (shrink)

In, Kosterec attempts to provide ``model-theoretic proofs'' of certain theses involving the normal modal operators $\Diamond$ and $\square$ and the truth-in-fiction operator $F$ which he then goes on to show have counterexamples in Kripke models. He concludes from this that the embedding of modal logic under the truth-in-fiction operator is unsound. We show instead that it is the ``model-theoretic proofs'' that are themselves unsound, involving illicit substitution, a subtle error that nevertheless allows us to draw an important (...) conclusion about intensional contexts and semantic equivalences. (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)

For a classical theory T, ℋ(T) denotes the intuitionistic theory of T-normal (i.e. locally T) Kripke structures. S. Buss has asked for a characterization of the theories in the range of ℋ and raised the particular question of whether HA is an ℋ-theory. We show that Ti∈ range(ℋ) iff Ti = ℋ(T). As a corollary, no fragment of HA extending iΠ1 belongs to the range of ℋ. A. Visser has already proved that HA is not in the range of (...) H by different methods. We provide more examples of theories not in the range of ℋ. We show PA-normality of once-branching Kripke models of HA + MP, where it is not known whether the same holds if MP is dropped. (shrink)

In this paper a propositional logic of viewpoints is presented. The language of this logic consists of the usual modal operatorsL (of necessity) andM (of possibility) as well as of two new operatorsA andR. The intuitive interpretations ofA andR are from all viewpoints and from some viewpoint, respectively. Semantically the language is interpreted by using Kripke models augmented with sets of viewpoints and with a new alternativeness relation for the operatorA. Truth values of formulas are evaluated with respect to (...) a world and a viewpoint. Various axiomatizations of the logic of viewpoints are presented and proved complete. Finally, some applications are given. (shrink)

As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other logical theory, action theories may also evolve, and thus knowledge engineers need revision methods to help in accommodating new incoming information about the behavior of actions in an adequate manner. The present work is about changing action domain descriptions in multimodal logic. Its contribution is threefold: first we revisit the semantics of action theory contraction proposed (...) in previous work, giving more robust operators that express minimal change based on a notion of distance between Kripke-models. Second we give algorithms for syntactical action theory contraction and establish their correctness with respect to our semantics for those action theories that satisfy a principle of modularity investigated in previous work. Since modularity can be ensured for every action theory and, as we show here, needs to be computed at most once during the evolution of a domain description, it does not represent a limitation at all to the method here studied. Finally we state AGM-like postulates for action theory contraction and assess the behavior of our operators with respect to them. Moreover, we also address the revision counterpart of action theory change, showing that it benefits from our semantics for contraction. (shrink)

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- (...) This dissertation focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

A model is proposed for interpreting the course of Western Science’s conception of mathematics from the time of the ancient Greeks to the present day. According to this model, philosophy of science, in general, has traced a horseshoe-shaped curve through time. The ‘horseshoe’ emerges with Pythagoras and other Greek scientists and has curved ‘back’—but not quite back—towards modern trends in philosophy of science, as for example espoused by Bas van Fraassen. Two features of a horseshoe are pertinent to (...) this metaphor: (1) The horseshoe’s semicircular shape models the emergence of science from monism towards dualism, and its modern return towards unity. (2) The logical ‘horseshoe’ operator (“if…then”) makes possible the logical rule ‘modus ponens’--so central to Western science’s deductive approach (which is reaching its limits). Descartes fits approximately at the turning point of the curve. ‘Where might the curve go next?’ is posed to the reader. (shrink)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in (...) Sections 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

Computational models have shown how polarisation can rise among deliberating agents as they approximate epistemic rationality. This paper provides further support for the thesis that polarisation can rise under condition of epistemic rationality, but it does not depend on limitations that extant models rely on, such as memory restrictions or biased evaluation of other agents’ testimony. Instead, deliberation is modelled through agents’ purposeful introduction of arguments and their rational reactions to introductions of others. This process induces polarisation dynamics on its (...) own. A second result is that the effect size of polarisation dynamics correlates with particular types of argumentative behaviour. Polarisation effects can be soothed when agents take into account the opinions of others as premises, and they are amplified as agents fortify their own beliefs. These results underpin the relevance of argumentation as a factor in social-epistemic processes and indicate that rising issue polarisation is not a reliable indicator of epistemic shortcomings. (shrink)

This article informally presents a solution to the paradoxes of truth and shows how the solution solves classical paradoxes (such as the original Liar) as well as the paradoxes that were invented as counterarguments for various proposed solutions (“the revenge of the Liar”). This solution complements the classical procedure of determining the truth values of sentences by its own failure and, when the procedure fails, through an appropriate semantic shift allows us to express the failure in a classical two-valued language. (...) Formally speaking, the solution is a language with one meaning of symbols and two valuations of the truth values of sentences. The primary valuation is a classical valuation that is partial in the presence of the truth predicate. It enables us to determine the classical truth value of a sentence or leads to the failure of that determination. The language with the primary valuation is precisely the largest intrinsic fixed point of the strong Kleene three-valued semantics (LIFPSK3). The semantic shift that allows us to express the failure of the primary valuation is precisely the classical closure of LIFPSK3: it extends LIFPSK3 to a classical language in parts where LIFPSK3 is undetermined. Thus, this article provides an argumentation, which has not been present in contemporary debates so far, for the choice of LIFPSK3 and its classical closure as the right model for the truth predicate. In the end, an erroneous critique of Kripke-Feferman axiomatic theory of truth, which is present in contemporary literature, is pointed out. (shrink)

Analysing several characteristic mathematical models: natural and real numbers, Euclidean geometry, group theory, and set theory, I argue that a mathematical model in its final form is a junction of a set of axioms and an internal partial interpretation of the corresponding language. It follows from the analysis that (i) mathematical objects do not exist in the external world: they are our internally imagined objects, some of which, at least approximately, we can realize or represent; (ii) mathematical truths are (...) not truths about the external world but specifications (formulations) of mathematical conceptions; (iii) mathematics is first and foremost our imagined tool by which, with certain assumptions about its applicability, we explore nature and synthesize our rational cognition of it. (shrink)

If we want to say that all truths are knowable Fitch’s Paradox leads us to conclude that all truths are known. Is it a real philosophical problem or a mere modeling problem? Is it possible to express the idea of knowability using modal logic? The Knowability Principle is expressed by the formula: if Phi is true then it is possible to know that Phi. But what is the meaning of possibility in this context? Using standard modal operators under what condition (...) can we express the idea of knowability? We will in particular examine the subjacent relations of the modal operators in a Kripke Model. We will define the possibility as the possibility of learning opposed to an unclear possibility. Then we will show that Fitch’s Paradox becomes clearer and we will examine how the Knowability Principle could be expressed in such frame. (shrink)

I present a new definition of verisimilitude, framed in terms of causes. Roughly speaking, according to it a scientific model is approximately true if it captures accurately the strengths of the causes present in any given situation. Against much of the literature, I argue that any satisfactory account of verisimilitude must inevitably restrict its judgments to context-specific models rather than general theories. We may still endorse—and only need—a relativized notion of scientific progress, understood now not as global advance but (...) rather as the mastering of particular problems. This also sheds new light on longstanding difficulties surrounding language-dependence and models committed to false ontologies. (shrink)

The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I (...) want to do something similar replacing the Kripkean sets of grounded true sentences with revision-theoretic sets of stable true sentences. This can be done by defining a monotone operator through a variant of van Fraassen’s supervaluation scheme which is simply based on ω-length iterations of the Tarskian operator. Clearly, all virtues of Kripke-style theories are preserved, and we can also prove that the resulting set of “grounded” true sentences shares some nice features with the sets of stable true sentences which are provided by the usual ways of formalising revision. What is expected is that a clearer philosophical content could be associated to this way of doing revision; hopefully, a content directly linked with the insights underlying finite revision processes. (shrink)

We present a novel approach to defining the mathematical constant π through the infinite den- sification of a sweeping net, which approximates a circle as the net becomes infinitely dense. By developing and enhancing notation related to sweeping nets and saddle maps, we establish a rigor- ous framework for expressing π in terms of the densification process using reverse integration. This method, inspired by the concept that numbers ”come from infinity,” leverages a reverse integral approach to model the transition (...) from infinite densification to the finite circle. Our work not only offers a new perspective on the geometric interpretation of π but also provides insights into reverse integration techniques and their applications in mathematical analysis. (shrink)

Alfred Tarski was one of the greatest logicians of the twentieth century. His influence comes not merely through his own work but from the legion of students who pursued his projects, both in Poland and Berkeley. This chapter focuses on three key areas of Tarski's research, beginning with his groundbreaking studies of the concept of truth. Tarski's work led to the creation of the area of mathematical logic known as model theory and prefigured semantic approaches in the philosophy of (...) language and philosophical logic, such as Kripke's possible worlds semantics for modal logic. We also examine the paradoxical decomposition of the sphere known as the Banach–Tarski paradox. Finally we examine Tarski's work on decidable and undecidable theories, which he carried out in collaboration with students such as Mostowski, Presburger, Robinson and others. (shrink)

The thesis deals with the concept of truth and the paradoxes of truth. Philosophical theories usually consider the concept of truth from a wider perspective. They are concerned with questions such as - Is there any connection between the truth and the world? And, if there is - What is the nature of the connection? Contrary to these theories, this analysis is of a logical nature. It deals with the internal semantic structure of language, the mutual semantic connection of sentences, (...) above all the connection of sentences that speak about the truth of other sentences and sentences whose truth they speak about. Truth paradoxes show that there is a problem in our basic understanding of the language meaning and they are a test for any proposed solution. It is important to make a distinction between the normative and analytical aspect of the solution. The former tries to ensure that paradoxes will not emerge. The latter tries to explain paradoxes. Of course, the practical aspect of the solution is also important. It tries to ensure a good framework for logical foundations of knowledge, for related problems in Artificial Intelligence and for the analysis of the natural language. Tarski’s analysis emphasized the T-scheme as the basic intuitive principle for the concept of truth, but it also showed its inconsistency with the classical logic. Tarski’s solution is to preserve the classical logic and to restrict the scheme: we can talk about the truth of sentences of a language only inside another essentially richer metalanguage. This solution is in harmony with the idea of reflexivity of thinking and it has become very fertile for mathematics and science in general. But it has normative nature | truth paradoxes are avoided in a way that in such frame we cannot even express paradoxical sentences. It is also too restrictive because, for the same reason we cannot express a situation in which there is a circular reference of some sentences to other sentences, no matter how common and harmless such a situation may be. Kripke showed that there is no natural restriction to the T-scheme and we have to accept it. But then we must also accept the riskiness of sentences | the possibility that under some circumstances a sentence does not have the classical truth value but it is undetermined. This leads to languages with three-valued semantics. Kripke did not give any definite model, but he gave a theoretical frame for investigations of various models | each fixed point in each three-valued semantics can be a model for the concept of truth. The solutions also have normative nature | we can express the paradoxical sentences, but we escape a contradiction by declaring them undetermined. Such a solution could become an analytical solution only if we provide the analysis that would show in a substantial way that it is the solution that models the concept of truth. Kripke took some steps in the direction of finding an analytical solution. He preferred the strong Kleene three-valued semantics for which he wrote it was "appropriate" but did not explain why it was appropriate. One reason for such a choice is probably that Kripke finds paradoxical sentences meaningful. This eliminates the weak Kleene three valued semantics which corresponds to the idea that paradoxical sentences are meaningless, and thus indeterminate. Another reason could be that the strong Kleene three valued semantics has the so-called investigative interpretation. According to this interpretation, this semantics corresponds to the classical determination of truth, whereby all sentences that do not have an already determined value are temporarily considered indeterminate. When we determine the truth value of these sentences, then we can also determine the truth value of the sentences that are composed of them. Kripke supplemented this investigative interpretation with an intuition about learning the concept of truth. That intuition deals with how we can teach someone who is a competent user of an initial language (without the predicate of truth T) to use sentences that contain the predicate T. That person knows which sentences of the initial language are true and which are not. We give her the rule to assign the T attribute to the former and deny that attribute to the latter. In that way, some new sentences that contain the predicate of truth, and which were indeterminate until then, become determinate. So the person gets a new set of true and false sentences with which he continues the procedure. This intuition leads directly to the smallest fixed point of strong Kleene semantics as an analytically acceptable model for the logical notion of truth. However, since this process is usually saturated only on some transfinite ordinal, this intuition, by climbing on ordinals, increasingly becomes a metaphor. This thesis is an attempt to give an analytical solution to truth paradoxes. It gives an analysis of why and how some sentences lack the classical truth value. The starting point is basic intuition according to which paradoxical sentences are meaningful (because we understand what they are talking about well, moreover we use it for determining their truth values), but they witness the failure of the classical procedure of determining their truth value in some "extreme" circumstances. Paradoxes emerge because the classical procedure of the truth value determination does not always give a classically supposed (and expected) answer. The analysis shows that such an assumption is an unjustified generalization from common situations to all situations. We can accept the classical procedure of the truth value determination and consequently the internal semantic structure of the language, but we must reject the universality of the exterior assumption of a successful ending of the procedure. The consciousness of this transforms paradoxes to normal situations inherent to the classical procedure. Some sentences, although meaningful, when we evaluate them according to the classical truth conditions, the classical conditions do not assign them a unique value. We can assign to them the third value, \undetermined", as a sign of definitive failure of the classical procedure. An analysis of the propagation of the failure in the structure of sentences gives exactly the strong Kleene three-valued semantics, not as an investigative procedure, as it occurs in Kripke, but as the classical truth determination procedure accompanied by the propagation of its own failure. An analysis of the circularities in the determination of the classical truth value gives the criterion of when the classical procedure succeeds and when it fails, when the sentences will have the classical truth value and when they will not. It turns out that the truth values of sentences thus obtained give exactly the largest intrinsic fixed point of the strong Kleene three-valued semantics. In that way, the argumentation is given for that choice among all fixed points of all monotone three-valued semantics for the model of the logical concept of truth. An immediate mathematical description of the fixed point is given, too. It has also been shown how this language can be semantically completed to the classical language which in many respects appears a natural completion of the process of thinking about the truth values of the sentences of a given language. Thus the final model is a language that has one interpretation and two systems of sentence truth evaluation, primary and final evaluation. The language through the symbol T speaks of its primary truth valuation, which is precisely the largest intrinsic fixed point of the strong Kleene three valued semantics. Its final truth valuation is the semantic completion of the first in such a way that all sentences that are not true in the primary valuation are false in the final valuation. (shrink)

Darcy's law is a phenomenological relationship for fluid flow rate that finds one of its principle applications in hydrology. Theoretical hydrologists rely upon a multiplicity of conceptual models to carry out approximate derivations of Darcy's law. These derivations provide structural explanations of the law; they require the application of fundamental principles, such as conservation of momentum, to idealized models of the porous media within which the flow occurs. In practice, recognition of the idealized conditions incorporated into models facilitates the empirical (...) clarification of the domain within which the law remains accurate. Structural explanations also contribute to the physical interpretation of phenomenological parameters. (shrink)