Results for 'Linear nested sequents'

816 found
Order:
  1. Nested Sequents for Intuitionistic Modal Logics via Structural Refinement.Tim Lyon - 2021 - In Anupam Das & Sara Negri (eds.), Automated Reasoning with Analytic Tableaux and Related Methods: TABLEAUX 2021. pp. 409-427.
    We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents.Tim Lyon, Alwen Tiu, Rajeev Gore & Ranald Clouston - 2020 - In Maribel Fernandez & Anca Muscholl (eds.), 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Dagstuhl, Germany: pp. 1-16.
    We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  3. Automating Reasoning with Standpoint Logic via Nested Sequents.Tim Lyon & Lucía Gómez Álvarez - 2018 - In Michael Thielscher, Francesca Toni & Frank Wolter (eds.), Proceedings of the Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR2018). pp. 257-266.
    Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 177-194.
    This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  5. Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005. Cambridge: Cambridge University Press. pp. 151-172.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  6. Modelling Combinatorial Auctions in Linear Logic.Daniele Porello & Ulle Endriss - 2010 - In Daniele Porello & Ulle Endriss (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, {KR} 2010, Toronto, Ontario, Canada, May 9-13, 2010.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  7. Logics Based on Linear Orders of Contaminating Values.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - Journal of Logic and Computation 29 (5):631–663.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  8. The ILLTP Library for Intuitionistic Linear Logic.Carlos Olarte, Valeria Correa Vaz De Paiva, Elaine Pimentel & Giselle Reis - manuscript
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Non-normal modalities in variants of linear logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Refining Labelled Systems for Modal and Constructive Logics with Applications.Tim Lyon - 2021 - Dissertation, Technischen Universität Wien
    This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  11. The Metaphysical Commitments of Logic.Thomas Brouwer - 2013 - Dissertation, University of Leeds
    This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  12. A resource-sensitive logic of agency.Daniele Porello & Nicolas Troquard - 2014 - In Ios Press (ed.), Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), Prague, Czech Republic. 2014. pp. 723-728.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  13. True, Truer, Truest.Brian Weatherson - 2005 - Philosophical Studies 123 (1):47-70.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  14.  60
    Combinatoriality and Compositionality in Everyday Primate Skills.Nathalie Gontier - forthcoming - International Journal of Primatology.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Modeling the interaction of computer errors by four-valued contaminating logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. Berlín, Alemania: pp. 119-139.
    Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of 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. Under such interpretations, the contaminating states represent occurrences of a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. Completeness of a first-order temporal logic with time-gaps.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - Theoretical Computer Science 160 (1-2):241-270.
    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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. Algorithmic Structuring of Cut-free Proofs.Matthias Baaz & Richard Zach - 1993 - In Börger Egon, Kleine Büning Hans, Jäger Gerhard, Martini Simone & Richter Michael M. (eds.), Computer Science Logic. CSL’92, San Miniato, Italy. Selected Papers. Springer. pp. 29–42.
    The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k : (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. Towards Tractable Approximations to Many-Valued Logics: the Case of First Degree Entailment.Alejandro Solares-Rojas & Marcello D’Agostino - 2022 - In Igor Sedlár (ed.), The Logica Yearbook 2021. College Publications. pp. 57-76.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Entre o natural e o artificial: visualização e representação no século XVI.Fumikazu Saito - manuscript
    Recentes estudos em história da ciência têm apresentado indícios de que é impossível estabelecer uma clara distinção entre estudos de óptica e de perspectiva linear quando nos referimos aos séculos XVI e XVII. Embora a perspectiva linear lidasse com a representação geométrica do espaço numa superfície bidimensional, estava, entretanto, estreitamente ligada a questões relativas à natureza da visão humana. Devemos considerar que, naquela época, o termo perspectiva era a tradução latina da palavra grega optikè, denotando a visão direta (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Nutrição e Suplementação Mineral de Bovinos de Corte.Emanuel Isaque Cordeiro da Silva - manuscript
    INTRODUÇÃO -/- A produção bovina no Brasil é fundamentalmente em condições de pastoreio, isto é, à pasto. Dado que as pastagens e as forragens não suprem as exigências minerais dos bovinos, principalmente na seca, a suplementação mineral desses animais torna-se uma prática essencial e obrigatória para obtenção de êxito na produção de carne e leite. Negligenciar os requerimentos minerais dos bovinos pode levar ao aparecimento de alterações metabólicas diretamente relacionadas com o desempenho produtivo do rebanho, além de complicações mínimas ou (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Puberdade e Estacionalidade Reprodutiva dos Animais.Emanuel Isaque Cordeiro da Silva - manuscript
    OBJETIVO -/- O estudante de Zootecnia e de Veterinária, quando se depara com a produção animal, um dos pilares importantes é a reprodução, uma vez que é a perpetuação da espécie, seja para gerar filhas de uma vaca campeã em produção leiteira e de um touro com rusticidade e com aptidão produtiva de corte, ou mesmo para reposição de um plantel, o mesmo deve estar consciente de que esse ramo é de extrema responsabilidade, já que estará intimamente lidando com a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  23. A Nonmonotonic Sequent Calculus for Inferentialist Expressivists.Ulf Hlobil - 2016 - In Pavel Arazim & Michal Dančák (eds.), The Logica Yearbook 2015. College Publications. pp. 87-105.
    I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity fails, but (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  24. Serendipity and inherent non-linear thinking can help address the climate and environmental conundrums.Quan-Hoang Vuong, Viet-Phuong La & Minh-Hoang Nguyen - 2024 - Aisdl Manuscripts.
    Humankind is currently confronted with a critical challenge that determines its very existence, not only on an individual, racial, or national level but as a whole species: the fight against climate change and environmental degradation. To win this battle, humanity needs innovations and non-linear thinking. Nature has long been a substantial information source for unthinkable discoveries that save human lives. The paper suggests that by understanding the nature, emergence, and mechanism of serendipity, the survival skill of humans, humanity can (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  25. Serendipity and inherent non-linear thinking can help address the climate and environmental conundrums.Quan-Hoang Vuong, Viet-Phuong La & Minh-Hoang Nguyen - 2024 - Ms Thoughts.
    Humankind is currently confronted with a critical challenge that determines its very existence, not only on an individual, racial, or national level but as a whole species: the fight against climate change and environmental degradation. To win this battle, humanity needs innovations and non-linear thinking. Nature has long been a substantial information source for unthinkable discoveries that save human lives. The paper suggests that by understanding the nature, emergence, and mechanism of serendipity, the survival skill of humans, humanity can (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  26. A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences.Jared Millson - 2019 - Studia Logica (6):1-34.
    In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  27. Nestes Modes, ’Qua’ and the Incarnation.Alexander R. Pruss - 2014 - European Journal for Philosophy of Religion 6 (2):65--80.
    A nested mode ontology allows one to make sense of apparently contradictory Christological claims such as that Christ knows everything and there are some things Christ does not know.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Uniform and Modular Sequent Systems for Description Logics.Tim Lyon & Jonas Karge - 2022 - In Ofer Arieli, Martin Homola, Jean Christoph Jung & Marie-Laure Mugnier (eds.), Proceedings of the 35th International Workshop on Description Logics (DL 2022).
    We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules.
    Download  
     
    Export citation  
     
    Bookmark  
  29. Nested Dissection for Sparse Null-Space Bases.Julio Michael Stern & Stephen Vavasis - 1993 - SIAM Journal of Matrix Analysis and Applications 14:766-775.
    The authors propose a nested dissection approach to finding a fundamental cycle basis in a planar graph. The cycle basis corresponds to a fundamental null-space basis of the adjacency matrix. This problem is meant to model sparse null-space basis computations occurring in a variety of settings. An O(n3/2) bound is achieved on the nullspace basis size (i.e., the number of nonzero entries in the basis), and an O(n log n) bound on the size in the special case of grid (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Dual Systems of Sequents and Tableaux for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Bulletin of the EATCS 51:192-197.
    The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of a truth value and (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  31. A cut-free sequent calculus for the bi-intuitionistic logic 2Int.Sara Ayhan - manuscript
    The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist reasoning, since they (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability.Valentin Goranko & Alberto Zanardo - 2007 - Logic Journal of the IGPL 15 (1):53-76.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  33. Super Linear Algebra.W. B. Vasantha Kandasamy & Florentin Smarandache - 2008 - Ann Arbor, MI, USA: ProQuest Information & Learning.
    In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). Many theorems on super linear algebra and its properties are proved. Some theorems are left as exercises for the reader. These new class of super linear algebras which can be thought of as a set of linear algebras, following a stipulated condition, will find applications in several fields using computers. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. The Dream of Geese Nesting in Trees: An Experiment that Tests an Interpretation.Maxson J. McDowell, Joenine E. Roberts & Nathalie Hausman - manuscript
    In an online, participatory class, we interpreted 'The Dream of Geese Nesting in Trees' knowing nothing of the dreamer beyond age and gender, and having none of the dreamer’s associations. Our interpretation included predictions about the dreamer. When it was complete, we asked the bringer of the dream (who had until then been mostly silent and who also gave no visual feedback to our discussion) to give us more information about the dreamer. Our main predictions were confirmed. Goslings are falling (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics.Tim Lyon - 2021 - Journal of Logic and Computation 31 (1):213-265.
    This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  36. A perspective on modal sequent logic.Stephen Blamey & Lloyd Humberstone - 1991 - Publications of the Research Institute for Mathematical Sciences 27 (5):763-782.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  37. Humean Laws and (Nested) Counterfactuals.Christian Loew & Siegfried Jaag - 2019 - Philosophical Quarterly 70 (278):93-113.
    Humean reductionism about laws of nature is the view that the laws reduce to the total distribution of non-modal or categorical properties in spacetime. A worry about Humean reductionism is that it cannot motivate the characteristic modal resilience of laws under counterfactual suppositions and that it thus generates wrong verdicts about certain nested counterfactuals. In this paper, we defend Humean reductionism by motivating an account of the modal resilience of Humean laws that gets nested counterfactuals right.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  38. Non-linear Analysis of Models for Biological Pattern Formation: Application to Ocular Dominance Stripes.Michael Lyons & Lionel G. Harrison - 1993 - In Frank Eeckman (ed.), Neural Systems: Analysis and Modeling. Springer. pp. 39-46.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Translating Metainferences Into Formulae: Satisfaction Operators and Sequent Calculi.Ariel Jonathan Roffé & Federico Pailos - 2021 - Australasian Journal of Logic 3.
    In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  40. Modelling Multilateral Negotiation in Linear Logic.Daniele Porello & Ulle Endriss - 2010 - In {ECAI} 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings. pp. 381--386.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. Log or linear? Distinct intuitions of the number scale in Western and Amazonian indigene cultures.Pierre Pica, Stanislas Dehaene, Elizabeth Spelke & Véronique Izard - 2008 - Science 320 (5880):1217-1220.
    The mapping of numbers onto space is fundamental to measurement and to mathematics. Is this mapping a cultural invention or a universal intuition shared by all humans regardless of culture and education? We probed number-space mappings in the Mundurucu, an Amazonian indigene group with a reduced numerical lexicon and little or no formal education. At all ages, the Mundurucu mapped symbolic and nonsymbolic numbers onto a logarithmic scale, whereas Western adults used linear mapping with small or symbolic numbers and (...)
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  42. A Simple Logical Matrix and Sequent Calculus for Parry’s Logic of Analytic Implication.Damian E. Szmuc - 2021 - Studia Logica 109 (4):791-828.
    We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  43. Nesting Polybia rejecta (Fabricius) (Hymenoptera: Vespidae) Associated with Azteca chartifex Forel (Hymenoptera: Formicidae) in Ecotone Caatinga/Atlantic Forest, in the State of Rio Grande do Norte.Francisco Virgínio - 2015 - Entomobrasillis 8 (3).
    Some neotropical social wasps which are associated with some vertebrates and other insects like ants, and these interactions are reported for decades, but little is known about the presence of these in the Caatinga and Atlantic Forest. This study describes the first association’s record between nests of Polybia rejecta (Fabricius) wasp and Azteca chartifex Forel ants in the transition area of the Atlantic Forest and Caatinga in Rio Grande do Norte. The observations were in a private forest in Monte Alegre, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44.  84
    Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees.Ruaan Kellerman & Valentin Goranko - 2021 - Journal of Symbolic Logic 86 (3):1035-1065.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  80
    Neutrosophic Treatment of Duality Linear Models and the Binary Simplex Algorithm.Maissam Jdid & Florentin Smarandache - 2023 - Prospects for Applied Mathematics and Data Analysis 2 (1).
    One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Standardised predictive linear models of managerial processes and the sustainability of graduate programmes (SGPs) in universities: A case study.Valentine Joseph Owan & Oni Enene Offu - 2021 - Contemporary Mathematics and Science Education 2 (1):Article ep21006.
    The exploration of the literature indicated that much studies abound in related areas. Much seems yet to be known about the nature of the relationship that exists between managerial variables and the sustainability of graduate programmes. To bridge this gap, we utilized a standardised multiple regression approach to build up linear models that examine three managerial processes (strategic planning, staff and information/communication management) and how they affect three proxies of the sustainability of graduate programmes (availability of funds and facilities, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  47. A multi-succedent sequent calculus for logical expressivists.Daniel Kaplan - 2018 - In Pavel Arazim & Tomáš Lávička (eds.), The Logica Yearbook 2017. College Publications. pp. 139-153.
    Expressivism in logic is the view that logical vocabulary plays a primarily expressive role: that is, that logical vocabulary makes perspicuous in the object language structural features of inference and incompatibility (Brandom, 1994, 2008). I present a precise, technical criterion of expressivity for a logic (§2). I next present a logic that meets that criterion (§3). I further explore some interesting features of that logic: first, a representation theorem for capturing other logics (§3.1), and next some novel logical vocabulary for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Disintegrating the Linear: Time in Simon Finn’s Instability.Marilyn Stendera - 2018 - In Exhibition Catalogue - Simon Finn's Instability.
    The art of Simon Finn has always had a markedly temporal dynamic. Vast structures built and annihilated again and again across different media, their fragmentation across space and time simultaneously methodical and darkly chaotic. Roiling waters and eldritch surfaces held captive in their unrest. Finn’s works render cycles of construction and disintegration, of stasis and motion, in ways that shed light upon the underlying structures of our experience of time while shattering simplistic notions of linearity. This is nowhere more apparent (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Geoengineering Governance, the Linear Model of Innovation, and the Accompanying Geoengineering Approach.Pak-Hang Wong & Nils Markusson - 2015 - The Climate Geoengineering Governance Working Papers.
    This paper aims to address the lack of critique of the linear model in geoengineering governance discourse, and to illustrate different considerations for a geoengineering governance framework that is not based on a linear model of technology innovation. Finally, we set to explore a particular approach to geoengineering governance based on Peter-Paul Verbeek’s notion of ‘technology accompaniment’.
    Download  
     
    Export citation  
     
    Bookmark  
  50. Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm.Marco Cococcioni, Massimo Pappalardo & Yaroslav Sergeyev - 2018 - Applied Mathematics and Computation 318:298-311.
    Numerous problems arising in engineering applications can have several objectives to be satisfied. An important class of problems of this kind is lexicographic multi-objective problems where the first objective is incomparably more important than the second one which, in its turn, is incomparably more important than the third one, etc. In this paper, Lexicographic Multi-Objective Linear Programming (LMOLP) problems are considered. To tackle them, traditional approaches either require solution of a series of linear programming problems or apply a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 816