We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear logic can easily represent bids in combinatorial auctions in which goods may be sold in multiple units, and we show how it naturally generalises several bidding languages familiar from the literature. Moreover, the winner determination problem, i.e., the problem of computing an allocation of goods to bidders producing a (...) certain amount of revenue for the auctioneer, can be modelled as the problem of finding a proof for a particular linear logic sequent. (shrink)

We show how to embed a framework for multilateral negotiation, in which a group of agents implement a sequence of deals concerning the exchange of a number of resources, into linear logic. In this model, multisets of goods, allocations of resources, preferences of agents, and deals are all modelled as formulas of linear logic. Whether or not a proposed deal is rational, given the preferences of the agents concerned, reduces to a question of provability, as does (...) the question of whether there exists a sequence of deals leading to an allocation with certain desirable properties, such as maximising social welfare. Thus, linear logic provides a formal basis for modelling convergence properties in distributed resource allocation. (shrink)

Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited. In this work we propose a library for benchmarking Girard's (propositional) intuitionistic linear logic. For a quick bootstrapping of the collection of problems, and for discussing the selection of relevant problems and understanding their meaning as linear logic theorems, we use translations of the collection of Kleene's (...) intuitionistic theorems in the traditional monograph "Introduction to Metamathematics". We analyze four different translations of intuitionistic logic into linear logic and compare their proofs using a linear logic based prover with focusing. In order to enhance the set of problems in our library, we apply the three provability-preserving translations to the propositional benchmarks in the ILTP Library. Finally, we generate a comprehensive set of reachability problems for Petri nets and encode such problems as linear logic sequents, thus enlarging our collection of problems. (shrink)

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class (...) of Kripke resource models extended with a neighbourhood function: modal Kripke resource models. We propose a Hilbert-style axiomatisation and a Gentzen-style sequent calculus. We show that the proof theories are sound and complete with respect to the class of modal Kripke resource models. We show that the sequent calculus admits cut elimination and that proof-search is in PSPACE. We then show how to extend the results when non-commutative connectives are added to the language. Finally, we put the l.. (shrink)

This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combinations, in various degrees, of languages and semantics for linear time with a modality for possible paths. We (...) then consider a hierarchy of natural classes of trees and bundled trees arising from a given class of linear orders and show that in general they provide different semantics. We also discuss transfer of definability from linear orders to trees and introduce a uniform translation from Priorean to Peircean formulae which transfers definability of properties of linear orders to definability of properties of all paths in trees. (shrink)

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with multiple contaminating (...) values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper. (shrink)

We study a fragment of Intuitionistic Linear Logic combined with non-normal modal operators. Focusing on the minimal modal logic, we provide a Gentzen-style sequent calculus as well as a semantics in terms of Kripke resource models. We show that the proof theory is sound and complete with respect to the class of minimal Kripke resource models. We also show that the sequent calculus allows cut elimination. We put the logical framework to use by instantiating it as a (...) logic of agency. In particular, we apply it to reason about the resource-sensitive use of artefacts. (shrink)

We present a study of linear models using the concepts of neutrosophic science, the science that was built on the basis that there is no absolute truth, there is no confirmed data, issues cannot be limited to right and wrong only. There is a third state between error and right, an indeterminate, undetermined, uncertain state. It is indeterminacy. Neutrosophic science gave each issue three dimensions, namely (T, I, F), correctness in degrees, indeterminacy in degrees, and error in degrees. It (...) was founded by the American philosopher and mathematician Florentin Smarandache, in 1995 and came as a generalization of fuzzy logic that was founded by the scientist Lotfi. A. Zadeh, in 1965. (shrink)

We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how to interpret them within an ontological framework. After showing how they can coexist with those of classical logic, we analyze three notions of artifact from the literature to conclude that these linear operators allow for reducing the ontological commitment (...) needed for their formalization, and even simplify their logical formulation. (shrink)

In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal (...) vocabulary—is directly motivated in terms of the simple, universal Kripke semantics for S5. The sequent system is cut-free and the circuit proofs are normalising. (shrink)

Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and agents' abilities for learning and recall. In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time and (...) knowledge. We discuss some complications that occur, even in the single-agent case, when interactions between time and knowledge are assumed and show how the method of incremental tableaux can be adapted to work in EXPSPACE, respectively 2EXPTIME, for these logics, thereby also matching the upper bounds obtained for them by Halpern and Vardi. (shrink)

We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justi cations and its relations with classical logic. We recall an extension of this approach to a logic dealing with assertions and obligations, related by a notion of causal implication [14, 45]. We focus on the extension to co-intuitionistic logic, seen as a logic of hypotheses [8, 9, 13] and on polarized bi-intuitionistic logic as a (...) class='Hi'>logic of assertions and conjectures: looking at the S4 modal translation, we give a de nition of a system AHL of bi-intuitionistic logic that correctly represents the duality between intuitionistic and co-intuitionistic logic, correcting a mistake in previous work [7, 10]. A computational interpretation of cointuitionism as a distributed calculus of coroutines is then used to give an operational interpretation of subtraction.Work on linear co-intuitionism is then recalled, a linear calculus of co-intuitionistic coroutines is de ned and a probabilistic interpretation of linear co-intuitionism is given as in [9]. Also we remark that by extending the language of intuitionistic logic we can express the notion of expectation, an assertion that in all situations the truth of p is possible and that in a logic of expectations the law of double negation holds. Similarly, extending co-intuitionistic logic, we can express the notion of conjecture that p, de ned as a hypothesis that in some situation the truth of p is epistemically necessary. (shrink)

We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice theory and judgment aggregation show. The proposed logics for modelling collective attitudes are based on a substructural propositional logic that allows for circumventing inconsistent outcomes. Individual and collective propositional attitudes, such as beliefs, desires, obligations, are then modelled by means of minimal (...) modalities to ensure a number of basic principles. In this way, a viable consistent modelling of collective attitudes is obtained. (shrink)

The first aim of this note is to describe an algebraic structure, more primitive than lattices and quantales, which corresponds to the intuitionistic flavour of Linear Logic we prefer. This part of the note is a total trivialisation of ideas from category theory and we play with a toy-structure a not distant cousin of a toy-language. The second goal of the note is to show a generic categorical construction, which builds models for Linear Logic, similar to (...) categorical models GC of [deP1990], but more general. The ultimate aim is to relate different categorical models of linear logic. (shrink)

We present some ideas on logical process descriptions, using relations from the DIO (Drug Interaction Ontology) as examples and explaining how these relations can be naturally decomposed in terms of more basic structured logical process descriptions using terms from linear logic. In our view, the process descriptions are able to clarify the usual relational descriptions of DIO. In particular, we discuss the use of logical process descriptions in proving linear logical theorems. Among the types of reasoning supported (...) by DIO one can distinguish both (1) basic reasoning about general structures in reality and (2) the domain-specific reasoning of experts. We here propose a clarification of this important distinction between (realist) reasoning on the basis of an ontology and rule-based inferences on the basis of an expert’s view. (shrink)

We present a new frame semantics for positive relevant and substructural propositional logics. This frame semantics is both a generalisation of Routley–Meyer ternary frames and a simplification of them. The key innovation of this semantics is the use of a single accessibility relation to relate collections of points to points. Different logics are modeled by varying the kinds of collections used: they can be sets, multisets, lists or trees. We show that collection frames on trees are sound and complete for (...) the basic positive distributive substructural logic $\mathsf {B}^+$, that collection frames on multisets are sound and complete for $\mathsf {RW}^+$ (the relevant logic $\mathsf {R}^+$, without contraction, or equivalently, positive multiplicative and additive linear logic with distribution for the additive connectives), and that collection frames on sets are sound for the positive relevant logic $\mathsf {R}^+$. The completeness of set frames for $\mathsf {R}^+$ is, currently, an open question. (shrink)

We study the first-order theories of some natural and important classes of coloured trees, including the four classes of trees whose paths have the order type respectively of the natural numbers, the integers, the rationals, and the reals. We develop a technique for approximating a tree as a suitably coloured linear order. We then present the first-order theories of certain classes of coloured linear orders and use them, along with the approximating technique, to establish complete axiomatisations of the (...) four classes of trees mentioned above. (shrink)

The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite to more definite (...) states is the partition join operation at the set level that prefigures at the quantum level projective measurement as well as the formation of maximally-definite state descriptions by Dirac’s Complete Sets of Commuting Operators. This development is measured quantitatively by logical entropy at the set level and by quantum logical entropy at the quantum level. This follow-the-math approach supports the Literal Interpretation of QM—as advocated by Abner Shimony among others which sees a reality of objective indefiniteness that is quite different from the common sense and classical view of reality as being “definite all the way down”. (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)

The new logic of partitions is dual to the usual Boolean logic of subsets (usually presented only in the special case of the logic of propositions) in the sense that partitions and subsets are category-theoretic duals. The new information measure of logical entropy is the normalized quantitative version of partitions. The new approach to interpreting quantum mechanics (QM) is showing that the mathematics (not the physics) of QM is the linearized Hilbert space version of the mathematics of (...) partitions. Or, putting it the other way around, the math of partitions is a skeletal version of the math of QM. The key concepts throughout this progression from logic, to logical information, to quantum theory are distinctions versus indistinctions, definiteness versus indefiniteness, or distinguishability versus indistinguishability. The distinctions of a partition are the ordered pairs of elements from the underlying set that are in different blocks of the partition and logical entropy is defined (initially) as the normalized number of distinctions. The cognate notions of definiteness and distinguishability run throughout the math of QM, e.g., in the key non-classical notion of superposition (= ontic indefiniteness) and in the Feynman rules for adding amplitudes (indistinguishable alternatives) versus adding probabilities (distinguishable alternatives). (shrink)

The first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete linear time) and trees of ω-segments (linear time with branching gaps) and some of its fragments are compared: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.

This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation (...) in logics that are weaker than classical logic, we investigate whether some well-known impossibility results, that were tailored for classical logic, still apply to those weak systems. (shrink)

Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms (...) of the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analysing first order definable and undefinable paths in trees. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be equivalent; (...) but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

Although the cognition is significant in strategic reasoning, its role has been weakly analyzed, because only the average intelligence is usually considered. For example, prisoner's dilemma in game theory, would have different outcomes for persons with different intelligence. I show how various levels of intelligence influence the quality of reasoning, decision, or the probability of psychosis. I explain my original methodology developed for my MA thesis in clinical psychology in 1998, and grant research in 1999, demonstrating the bias of the (...) classic IQ method, and how the intelligence limits thinking. Based on that I defined Personality Model, providing insight into understanding of psychosis (schizophrenia, bi-polar), which has not been explained yet by psychology or psychiatry. In addition, it enables to analyze and assess non-linear problems, utilizable in computer programming, visualization (animation) or other fields including Baduk game. I've already applied some principles in complex information system www.each.co.uk, and video-animations exhibited in London, Germany, Tokyo. I need to mention my experience in chess composition between 1994 and 2000, winning a few international prizes and inventing a special class of fairy rules redefining the mate. The chess composition principles or patterns show the way to organize logical series to higher advanced mechanisms (like calculus), applicable to other fields. One of such principles is a logical aesthetic innovation: new strategy, defined by Italian composers. Finally I show how the simple redefinition of the classic utility concept links economics and psychology to explain irrational / destructive behavior. All presented results (from the research) can be repeated. (shrink)

We argue that the need for commentary in commonly used linear calculi of natural deduction is connected to the “deletion” of illocutionary expressions that express the role of propositions as reasons, assumptions, or inferred propositions. We first analyze the formalization of an informal proof in some common calculi which do not formalize natural language illocutionary expressions, and show that in these calculi the formalizations of the example proof rely on commentary devices that have no counterpart in the original proof. (...) We then present a linear natural deduction calculus that makes use of formal illocutionary expressions in such a way that unique readability for derivations is guaranteed – thus showing that formalizing illocutionary expressions can eliminate the need for commentary. (shrink)

This thesis describes two classes of Dialectica categories. Chapter one introduces dialectica categories based on Goedel's Dialectica interpretation and shows that they constitute a model of Girard's Intuitionistic Linear Logic. Chapter two shows that, with extra assumptions, we can provide a comonad that interprets Girard's !-course modality. Chapter three presents the second class of Dialectica categories, a simplification suggested by Girard, that models (classical) Linear Logic and chapter four shows how to provide modalities ! and ? (...) for this second class of construction. (shrink)

In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.

The model of a closed linear measure space, which can be used to model Aristotle’s treatment of motion (kinesis), can be analogically extended to the qualitative ‘spaces’ implied by his theory of contraries in Physics I and in Metaphysics Iota, and to the dimensionless ‘space’ of the unity of matter and form discussed in book Eta of the Metaphysics. By examining Aristotle’s remarks on contraries, the subject of change, continuity, and the unity of matter and form, Aristotle’s thoughts on (...) motion, on contraries, and on the unity of substance can be brought together under a single interpretive framework, which can provide an approach to interpreting his ontology. (shrink)

Science is the basis for managing the affairs of life and human activities, and living without knowledge is a form of wandering and a kind of loss. Using scientific methods helps us understand the foundations of choice, decision-making, and adopting the right solutions when solutions abound and options are numerous. Operational research is considered the best that scientific development has provided because its methods depend on the application of scientific methods in solving complex issues and the optimal use of available (...) resources in various fields, private and governmental work in peace and war, in politics and economics, in planning and implementation, and in various aspects of life. Its basic essence is to use the data provided for the issue under study to build a mathematical model that is the optimal solution. It is the basis on which decision makers rely in managing institutions and companies, and when operations research methods meet with the neutrosophic teacher, we get ideal solutions that take into account all the circumstances and fluctuations that may occur in the work environment over time. One of the most important operations research methods is the linear programming method. Which prompted us to reformulate the linear models, the graphical method, and the simplex method, which are used to obtain the optimal solution for linear models using the concepts of neutrosophic science. In this research, and as a continuation of what we presented previously, we will reformulate the modified simplex algorithm that was presented to address the difficulty that we were facing when applying the direct simplex algorithm. It is the large number of calculations required to be performed in each step of the solution, which requires a lot of time and effort. (shrink)

The impossibility results in judgement aggregation show a clash between fair aggregation procedures and rational collective outcomes. In this paper, we are interested in analysing the notion of rational outcome by proposing a proof-theoretical understanding of collective rationality. In particular, we use the analysis of proofs and inferences provided by linear logic in order to define a fine-grained notion of group reasoning that allows for studying collective rationality with respect to a number of logics. We analyse the well-known (...) paradoxes in judgement aggregation and we pinpoint the reasoning steps that trigger the inconsistencies. Moreover, we extend the map of possibility and impossibility results in judgement aggregation by discussing the case of substructural logics. In particular, we show that there exist fragments of linear logic for which general possibility results can be obtained. (shrink)

In this paper, I discuss the analysis of logic in the pragmatic approach recently proposed by Brandom. I consider different consequence relations, formalized by classical, intuitionistic and linear logic, and I will argue that the formal theory developed by Brandom, even if provides powerful foundational insights on the relationship between logic and discursive practices, cannot account for important reasoning patterns represented by non-monotonic or resource-sensitive inferences. Then, I will present an incompatibility semantics in the framework of (...) linear logic which allow to refine Brandom’s concept of defeasible inference and to account for those non-monotonic and relevant inferences that are expressible in linear logic. Moreover, I will suggest an interpretation of discursive practices based on an abstract notion of agreement on what counts as a reason which is deeply connected with linear logic semantics. (shrink)

The present text provides a logical theory which originated in the unification of a number of well-known philosophical logics as well as the introduction and study of new operators. Further M-logic contains an object theory. With both the logical part and the object part we achieve a formal calculus that is able to express many metaphysical dogmas.

Simple partial logic (=SPL) is, broadly speaking, an extensional logic which allows for the truth-value gap. First I give a system of propositional SPL by partializing classical logic, as well as extending it with several non-classical truth-functional operators. Second I show a way based on SPL to construct a system of tensed ontology, by representing tensed statements as two kinds of necessary statements in a linear model that consists of the present and future worlds. Finally I (...) compare that way with other two ways based on Łukasiewicz’s three-valued logic and branching temporal logic. (shrink)

Barbour shows that time does not exist in the physical world, and similar conclusions are reached by others such as Deutsch, Davies and Woodward. Every possible configuration of a physical environment simply exists in the universe. The system is objectively static. Observation, however, is an inherently transtemporal phenomenon, involving actual or effective change of the configuration, collapse. Since, in a static environment, all possible configurations exist, transtemporal reality is of the logical type of a movie. The frame of a movie (...) film is of one logical type, an element of a set of frames, the movie, itself of a second logical type. In a static no-collapse universe, the configurations are of the first logical type, transtemporal reality of the second. To run, the movie requires iteration, a third logical type. Phenomenal consciousness is subjectively experienced as of this third logical type with regard to physical configurations. Everett's formulation clearly describes the transtemporal reality of an observer, which follows the physical in the linear dynamics, but departs from it on observation, giving rise to the the appearance of collapse, and the alternation of dynamics defined in the standard von Neumann-Dirac formulation. Since there is no physical collapse, his formulation is disputed. Given an iterator of the third logical type, the appearance of collapse is simply evidence of iteration. Chalmers demonstrates that phenomenal consciousness is of this logical type, an emergent property of the unitary system as a whole. Given an iterative function of this nature, one contextual to the physical configurations, paradoxes of time are resolved. Subjectively, meaning from the perspective of the iterative process, time passes in an objectively static universe, and the appearance of collapse is effected. (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 paper develops Lambda Grammars, a form of categorial grammar that, unlike other categorial formalisms, is non-directional. Linguistic signs are represented as sequences of lambda terms and are combined with the help of linear combinators.

In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). (...) It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) (...) and of the authors' temporal logic of linear discrete time with gaps follows. (shrink)

While many different mechanisms contribute to the generation of spatial order in biological development, the formation of morphogenetic fields which in turn direct cell responses giving rise to pattern and form are of major importance and essential for embryogenesis and regeneration. Most likely the fields represent concentration patterns of substances produced by molecular kinetics. Short range autocatalytic activation in conjunction with longer range “lateral” inhibition or depletion effects is capable of generating such patterns (Gierer and Meinhardt, 1972). Non-linear reactions (...) are required, and mathematical criteria were derived to design molecular models capable of pattern generation. The classical embryological feature of proportion regulation can be incorporated into the models. The conditions are mathematically necessary for the simplest two-factor case, and are likely to be a fair approximation in multi-component systems in which activation and inhibition are systems parameters subsuming the action of several agents. Gradients, symmetric and periodic patterns, in one or two dimensions, stable or pulsing in time, can be generated on this basis. Our basic concept of autocatalysis in conjunction with lateral inhibition accounts for self-regulatory biological features, including the reproducible formation of structures from near-uniform initial conditions as required by the logic of the generation cycle. Real tissue form, for instance that of budding Hydra, may often be traced back to local curvature arising within an initially relatively flat cell sheet, the position of evagination being determined by morphogenetic fields. Shell theory developed for architecture may also be applied to such biological processes. (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 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)

In this paper we discuss a new perspective on the syntax-semantics interface. Semantics, in this new set-up, is not ‘read off’ from Logical Forms as in mainstream approaches to generative grammar. Nor is it assigned to syntactic proofs using a Curry-Howard correspondence as in versions of the Lambek Calculus, or read off from f-structures using Linear Logic as in Lexical-Functional Grammar (LFG, Kaplan & Bresnan [9]). All such approaches are based on the idea that syntactic objects (trees, proofs, (...) fstructures) are somehow prior and that semantics must be parasitic on those syntactic objects. We challenge this idea and develop a grammar in which syntax and semantics are treated in a strictly parallel fashion. The grammar will have many ideas in common with the (converging) frameworks of categorial grammar and LFG, but its treatment of the syntax-semantics interface is radically different. Also, although the meaning component of the grammar is a version of Montague semantics and although there are obvious affinities between Montague’s conception of grammar and the work presented here, the grammar is not compositional, in the sense that composition of meaning need not follow surface structure. (shrink)

This paper introduces λ-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, λ-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of linear combinators, closed pure λ-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable.

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing (...) these versions of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic. (shrink)

We discuss the role of perceptron (or threshold) connectives in the context of Description Logic, and in particular their possible use as a bridge between statistical learning of models from data and logical reasoning over knowledge bases. We prove that such connectives can be added to the language of most forms of Description Logic without increasing the complexity of the corresponding inference problem. We show, with a practical example over the Gene Ontology, how even simple instances of perceptron (...) connectives are expressive enough to represent learned, complex concepts derived from real use cases. This opens up the possibility to import concepts learnt from data into existing ontologies. (shrink)

We all know that problems of transportation and allocation appear frequently in practical life. We need to transfer materials from production centers to consumption centers to secure the areas’ need for the transported material or allocate machines or people to do a specific job at the lowest cost, or in the shortest time. We know that the cost factors Time is one of the most important factors that decision-makers care about because it plays an “important” role in many of the (...) practical and scientific issues that we face in our daily lives, and we need careful study to enable us to avoid losses. For this, the linear programming method was used, which is one of the research methods. Processes, where the problem data is converted into a linear mathematical model for which the optimal solution achieves the desired goal. Since these models are linear models, we can solve them using the direct simplex method and its modifications, but the specificity that these models enjoy has enabled scholars and researchers to find special methods that help us in obtaining the optimal solution. Whatever the method used, the goal is to determine the number of units transferred from any material from production centers to consumption centers, or to allocate a machine or person to do a job so that the cost or time is as short as possible. These issues were addressed according to classical logic, but the ideal solution was a specific value appropriate to the conditions in which the data was collected and does not take into account the changes that may occur in the work environment. In order to obtain results that are more accurate and enjoy a margin of freedom, we present in this book a study of transport issues and neutrosophic allocation issues and some methods for solving them. By neutrosophic issues we mean These are the problems in which the data are neutrosophic values, i.e. the required quantities and the available quantities. (shrink)

‎A universal schema for diagonalization was popularized by N. S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fit more theorems in the universal‎ ‎schema of diagonalization‎, ‎such as Euclid's proof for the infinitude of the primes and new proofs (...) of G. Boolos (1997) for Cantor's theorem on the non-equinumerosity of a set with its powerset‎. ‎Then‎, ‎in Linear Temporal Logic‎, ‎we show the non-existence of a fixed-point in this logic whose proof resembles the argument of Yablo's paradox (1985‎, ‎1993)‎. ‎Thus‎, ‎Yablo's paradox turns for the first time into a genuine mathematico-logical theorem in the framework of Linear Temporal Logic‎. ‎Again the diagonal schema of the paper is used in this proof; and it is also shown that G. Priest's inclosure schema (1997) can fit in our universal diagonal / fixed-point schema‎. ‎We also show the existence of dominating (Ackermann-like) functions (which dominate a given countable set of functions‎, ‎such as primitive recursive functions) in the schema. (shrink)

Human language, hominin tool production modes, and multimodal communications systems of primates and other animals are currently well-studied for how they display compositionality or combinatoriality. In all cases, the former is defined as a kind of hierarchical nesting and the latter as a lack thereof. In this article, I extend research on combinatoriality and compositionality further to investigations of everyday primate skills. Daily locomotion modes as well as behaviors associated with subsistence practices, hygiene, or body modification rely on the hierarchical (...) nesting of different behavioral and cognitive actions into complex skills. I introduce a scheme which uses hierarchical organization to differentiate combinatorial from compositional skills. Combinatorial skills are defined either as aggregational or linearly hierarchical depending on whether the skill occurs momentarily in space or unfolds sequentially over time. Compositional skills are defined either as nested or interactionally hierarchical depending on whether the skill results in new constructs or in new interactions between existing constructs. The methodology I propose combines epistemological hierarchy theory with data from primatological field research and experimental and comparative psychological research and provides a means to integrate current constructionist and extended views on cognition and action with older research on behavioral logics in psychology and operational chain thinking in anthropology. The approach furthermore synchronizes with ongoing research on teleonomy, intentionality, and creativity. -/- . (shrink)

What the world needs now is another theory of vagueness. Not because the old theories are useless. Quite the contrary, the old theories provide many of the materials we need to construct the truest theory of vagueness ever seen. The theory shall be similar in motivation to supervaluationism, but more akin to many-valued theories in conceptualisation. What I take from the many-valued theories is the idea that some sentences can be truer than others. But I say very different things to (...) the ordering over sentences this relation generates. I say it is not a linear ordering, so it cannot be represented by the real numbers. I also argue that since there is higher-order vagueness, any mapping between sentences and mathematical objects is bound to be inappropriate. This is no cause for regret; we can say all we want to say by using the comparative truer than without mapping it onto some mathematical objects. From supervaluationism I take the idea that we can keep classical logic without keeping the familiar bivalent semantics for classical logic. But my preservation of classical logic is more comprehensive than is normally permitted by supervaluationism, for I preserve classical inference rules as well as classical sequents. And I do this without relying on the concept of acceptable precisifications as an unexplained explainer. The world does not need another guide to varieties of theories of vagueness, especially since Timothy Williamson (1994) and Rosanna Keefe (2000) have already provided quite good guides. I assume throughout familiarity with popular theories of vagueness. (shrink)