Results for '준선형 논리, 표준 완전성, 누승, 약한 결합 유니놈, 유니놈, semilinear logic, standard completeness, involution, weak associative uninorm, uninorm'

966 found
Order:
  1.  4
    Involutive Semilinear Logic and Weak Associativity. 양은석 - 2024 - Journal of the Society of Philosophical Studies 70:217-237.
    이 논문은 약한 결합 형식을 갖는 두 준선형 논리와 그것들의 누승적 확장 논리 사이의 동치 관계와 이러한 논리 체계 중 한 논리 체계의 표준 완전성을 다룬다. 좀더 구체적으로 먼저 논리 IWAUBUL을 약한 결합 형태를 갖는 준선형 논리 WAUBUL의 누승적 확장으로 소개하고 이 체계의 대수적 의미론을 다룬다. 특히 우리는 IWAUBUL이 WAUIBUL 체계와 동치라는 것을 보인다. 다음으로 우리는 관련된 약한 결합 힝식을 만족하는 누승적 미카놈을 소개한다. 마지막으로 이 논리를 위한 대수적 조건들에 바탕을 둔 표준 완전성을 다룬다.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  16
    Involutive Weak u-associative Fuzzy Logic WAuIBUL.Eunsuk Yang - 2024 - CHUL HAK SA SANG - Journal of Philosophical Ideas 92 (92):71-89.
    An involutive micanorm-based logic with a weak form of associativity is introduced and its finite standard completeness is addressed. More precisely, we first introduce the logic WAuIBUL as a [0, u]-continuous wau-uninorm analogue of the involutive logic IBUL. We next discuss its algebraic semantics. We then introduce involutive wau-uninorms as involutive uninorms with weak u-associativity in place of associativity and deal with related properties. We last provide finite strong standard completeness for WAuIBUL using a construction (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  24
    Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness.Sándor Jenei - 2022 - Archive for Mathematical Logic 62 (1):67-86.
    An algebraic proof is presented for the finite strong standard completeness of the Involutive Uninorm Logic with Fixed Point ($${{\mathbf {IUL}}^{fp}}$$ IUL fp ). It may provide a first step towards settling the standard completeness problem for the Involutive Uninorm Logic ($${\mathbf {IUL}}$$ IUL, posed in G. Metcalfe, F. Montagna. (J Symb Log 72:834–864, 2007)) in an algebraic manner. The result is proved via an embedding theorem which is based on the structural description of the class (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  14
    ItUML and Esteva-Godo-style standard completeness.Eunsuk Yang - 2023 - CHUL HAK SA SANG - Journal of Philosophical Ideas 89 (89):341-357.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  35
    On the logic that preserves degrees of truth associated to involutive Stone algebras.Liliana M. Cantú & Martín Figallo - 2020 - Logic Journal of the IGPL 28 (5):1000-1020.
    Involutive Stone algebras were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued Łukasiewicz–Moisil algebras. In this work we focus on the logic that preserves degrees of truth associated to S-algebras named Six. This follows a very general pattern that can be considered for any class of truth structure endowed with an ordering relation, and which intends to exploit many-valuedness focusing on the notion of inference that results from preserving lower bounds of truth values, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  4
    Fixed-pointed Involutive Micanorm-based Logics.Eunsuk Yang - 2022 - Korean Journal of Logic 25 (2):121-137.
    This paper considers standard completeness for fixed-pointed involutive micanorm-based logics. For this, we first discuss fixed-pointed involutive micanorm-based logics together with their algebraic semantics. Next, after introducing some examples of fixed-pointed involutive micanorms, we provide standard completeness results for those logics.
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  40
    The $L\Pi$ and $L\Pi\frac{1}{2}$ logics: two complete fuzzy systems joining Łukasiewicz and Product Logics. [REVIEW]Francesc Esteva, Lluís Godo & Franco Montagna - 2001 - Archive for Mathematical Logic 40 (1):39-67.
    In this paper we provide a finite axiomatization (using two finitary rules only) for the propositional logic (called $L\Pi$ ) resulting from the combination of Lukasiewicz and Product Logics, together with the logic obtained by from $L \Pi$ by the adding of a constant symbol and of a defining axiom for $\frac{1}{2}$ , called $L \Pi\frac{1}{2}$ . We show that $L \Pi \frac{1}{2}$ contains all the most important propositional fuzzy logics: Lukasiewicz Logic, Product Logic, Gödel's Fuzzy Logic, Takeuti and Titani's (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  8.  36
    The finite model property for semilinear substructural logics.San-Min Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):268-273.
    In this paper, we show that the finite model property fails for certain non‐integral semilinear substructural logics including Metcalfe and Montagna's uninorm logic and involutive uninorm logic, and a suitable extension of Metcalfe, Olivetti and Gabbay's pseudo‐uninorm logic. Algebraically, the results show that certain classes of bounded residuated lattices that are generated as varieties by their linearly ordered members are not generated as varieties by their finite members.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  41
    On n -contractive fuzzy logics.Rostislav Horčík, Carles Noguera & Milan Petrík - 2007 - Mathematical Logic Quarterly 53 (3):268-288.
    It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w. r. t. the class of all finite MTL-chains. In order to reach a deeper understanding of the structure of this class, we consider the extensions of MTL by adding the generalized contraction since each finite MTL-chain satisfies a form of this generalized contraction. Simultaneously, we also consider extensions of MTL by the generalized excluded middle laws introduced in [9] and the axiom of weak (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  10.  73
    Weak relevant justification logics.Shawn Standefer - 2023 - Journal of Logic and Computation 33 (7):1665–1683.
    This paper will develop ideas from [44]. We will generalize their work in two directions. First, we provide axioms for justification logics over the base logic B and show that the logic permits a proof of the internalization theorem. Second, we provide alternative frames that more closely resemble the standard versions of the ternary relational frames, as well as a more general approach to the completeness proof. We prove that soundness and completeness hold for justification logics over a wide (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  11.  39
    On triangular norm based axiomatic extensions of the weak nilpotent minimum logic.Carles Noguera, Francesc Esteva & Joan Gispert - 2008 - Mathematical Logic Quarterly 54 (4):387-409.
    In this paper we carry out an algebraic investigation of the weak nilpotent minimum logic and its t-norm based axiomatic extensions. We consider the algebraic counterpart of WNM, the variety of WNM-algebras and prove that it is locally finite, so all its subvarieties are generated by finite chains. We give criteria to compare varieties generated by finite families of WNM-chains, in particular varieties generated by standard WNM-chains, or equivalently t-norm based axiomatic extensions of WNM, and we study their (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  12.  15
    The Standard Model's Form Derived From Operator Logic, Superluminal Transformations and Gl(16).Stephen Blaha - 2010 - Pingree-Hill.
    This new edition of work that has evolved over the past seven years completes the derivation of the form of The Standard Model from quantum theory and the extension of the Theory of Relativity to superluminal transformations. The much derided form of The Standard Model is established from a consideration of Lorentz and superluminal relativistic space-time transformations. So much so that other approaches to elementary particle theory pale in comparison. In previous work color SU(3) was derived from space-time (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  7
    Left Variable Inclusion Logics Associated with Classical Logic.Francesco Paoli & Michele Pra Baldi - 2024 - Notre Dame Journal of Formal Logic 65 (4):457-480.
    Logics of significance have been proposed in an attempt to overcome the shortcomings of classical logic as a model of reasoning in the presence of nonsignificant (e.g., meaningless, ill-formed, unverifiable) sentences. Many-valued logicians have addressed this problem by introducing logics with infectious truth values. Cases in point are the weak Kleene logics B3 (paracomplete weak Kleene logic) and PWK (paraconsistent weak Kleene logic). Over time, it has become clear that the valid entailments of these significance logics obey (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  57
    Completeness of MLL Proof-Nets w.r.t. Weak Distributivity.Jean-Baptiste Joinet - 2007 - Journal of Symbolic Logic 72 (1):159 - 170.
    We examine 'weak-distributivity' as a rewriting rule $??$ defined on multiplicative proof-structures (so, in particular, on multiplicative proof-nets: MLL). This rewriting does not preserve the type of proof-nets, but does nevertheless preserve their correctness. The specific contribution of this paper, is to give a direct proof of completeness for $??$: starting from a set of simple generators (proof-nets which are a n-ary ⊗ of &-ized axioms), any mono-conclusion MLL proof-net can be reached by $??$ rewriting (up to ⊗ and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15.  35
    Algebraic semantics and model completeness for Intuitionistic Public Announcement Logic.Minghui Ma, Alessandra Palmigiano & Mehrnoosh Sadrzadeh - 2014 - Annals of Pure and Applied Logic 165 (4):963-995.
    In the present paper, we start studying epistemic updates using the standard toolkit of duality theory. We focus on public announcements, which are the simplest epistemic actions, and hence on Public Announcement Logic without the common knowledge operator. As is well known, the epistemic action of publicly announcing a given proposition is semantically represented as a transformation of the model encoding the current epistemic setup of the given agents; the given current model being replaced with its submodel relativized to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  16.  17
    Weak Necessity on Weak Kleene Matrices.Fabrice Correia - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 73-90.
    A possible world semantics for standard modal languages is presented, where the valuation functions are allowed to be partial, the truth–functional connectives are interpreted according to weak Kleene matrices, and the necessity operator is given a “weak” interpretation. Completeness and incompleteness results for some (axiomatic) systems are then established. Extensions of these modal logics in which figure “statability” operators are also examined.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  17.  75
    Pavelka-style completeness in expansions of Łukasiewicz logic.Hector Freytes - 2008 - Archive for Mathematical Logic 47 (1):15-23.
    An algebraic setting for the validity of Pavelka style completeness for some natural expansions of Łukasiewicz logic by new connectives and rational constants is given. This algebraic approach is based on the fact that the standard MV-algebra on the real segment [0, 1] is an injective MV-algebra. In particular the logics associated with MV-algebras with product and with divisible MV-algebras are considered.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  18.  28
    Extension Properties and Subdirect Representation in Abstract Algebraic Logic.Tomáš Lávička & Carles Noguera - 2018 - Studia Logica 106 (6):1065-1095.
    This paper continues the investigation, started in Lávička and Noguera : 521–551, 2017), of infinitary propositional logics from the perspective of their algebraic completeness and filter extension properties in abstract algebraic logic. If follows from the Lindenbaum Lemma used in standard proofs of algebraic completeness that, in every finitary logic, intersection-prime theories form a basis of the closure system of all theories. In this article we consider the open problem of whether these properties can be transferred to lattices of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  46
    Weak Negation in Inquisitive Semantics.Vít Punčochář - 2015 - Journal of Logic, Language and Information 24 (3):323-355.
    This paper introduces and explores a conservative extension of inquisitive logic. In particular, weak negation is added to the standard propositional language of inquisitive semantics, and it is shown that, although we lose some general semantic properties of the original framework, such an enrichment enables us to model some previously inexpressible speech acts such as weak denial and ‘might’-assertions. As a result, a new modal logic emerges. For this logic, a Fitch-style system of natural deduction is formulated. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  20.  44
    An intuitionistic logic for preference relations.Paolo Maffezioli & Alberto Naibo - 2019 - Logic Journal of the IGPL 27 (4):434-450.
    We investigate in intuitionistic first-order logic various principles of preference relations alternative to the standard ones based on the transitivity and completeness of weak preference. In particular, we suggest two ways in which completeness can be formulated while remaining faithful to the spirit of constructive reasoning, and we prove that the cotransitivity of the strict preference relation is a valid intuitionistic alternative to the transitivity of weak preference. Along the way, we also show that the acyclicity axiom (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  58
    Implicational (semilinear) logics I: a new hierarchy. [REVIEW]Petr Cintula & Carles Noguera - 2010 - Archive for Mathematical Logic 49 (4):417-446.
    In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives they possess. It yields a new classification of logics expanding Leibniz (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  22. One-Step Modal Logics, Intuitionistic and Classical, Part 2.Harold T. Hodes - 2021 - Journal of Philosophical Logic 50 (5):873-910.
    Part 1 [Hodes, 2021] “looked under the hood” of the familiar versions of the classical propositional modal logic K and its intuitionistic counterpart. This paper continues that project, addressing some familiar classical strengthenings of K and GL), and their intuitionistic counterparts. Section 9 associates two intuitionistic one-step proof-theoretic systems to each of the just mentioned intuitionistic logics, this by adding for each a new rule to those which generated IK in Part 1. For the systems associated with the intuitionistic counterparts (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  83
    A logical expression of reasoning.Arthur Buchsbaum, Tarcisio Pequeno & Marcelino Pequeno - 2007 - Synthese 154 (3):431 - 466.
    A non-monotonic logic, the Logic of Plausible Reasoning (LPR), capable of coping with the demands of what we call complex reasoning, is introduced. It is argued that creative complex reasoning is the way of reasoning required in many instances of scientific thought, professional practice and common life decision taking. For managing the simultaneous consideration of multiple scenarios inherent in these activities, two new modalities, weak and strong plausibility, are introduced as part of the Logic of Plausible Deduction (LPD), a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  4
    Strong standard completeness theorems for S5-modal Łukasiewicz logics.Diego Castaño, José Patricio Díaz Varela & Gabriel Savoy - 2025 - Annals of Pure and Applied Logic 176 (3):103529.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  93
    Substructural Fuzzy-Relevance Logic.Eunsuk Yang - 2015 - Notre Dame Journal of Formal Logic 56 (3):471-491.
    This paper proposes a new topic in substructural logic for use in research joining the fields of relevance and fuzzy logics. For this, we consider old and new relevance principles. We first introduce fuzzy systems satisfying an old relevance principle, that is, Dunn’s weak relevance principle. We present ways to obtain relevant companions of the weakening-free uninorm systems introduced by Metcalfe and Montagna and fuzzy companions of the system R of relevant implication and its neighbors. The algebraic structures (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  77
    A proof of standard completeness for Esteva and Godo's logic MTL.Sándor Jenei & Franco Montagna - 2002 - Studia Logica 70 (2):183-192.
    In the present paper we show that any at most countable linearly-ordered commutative residuated lattice can be embedded into a commutative residuated lattice on the real unit interval [0, 1]. We use this result to show that Esteva and Godo''s logic MTL is complete with respect to interpretations into commutative residuated lattices on [0, 1]. This solves an open problem raised in.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  27. What is a Compendium? Parataxis, Hypotaxis, and the Question of the Book.Maxwell Stephen Kennel - 2013 - Continent 3 (1):44-49.
    Writing, the exigency of writing: no longer the writing that has always (through a necessity in no way avoidable) been in the service of the speech or thought that is called idealist (that is to say, moralizing), but rather the writing that through its own slowly liberated force (the aleatory force of absence) seems to devote itself solely to itself as something that remains without identity, and little by little brings forth possibilities that are entirely other: an anonymous, distracted, deferred, (...)
     
    Export citation  
     
    Bookmark  
  28.  39
    Modal logic with non-deterministic semantics: Part I—Propositional case.Marcelo E. Coniglio, Fariñas Del Cerro Luis & Marques Peron Newton - 2020 - Logic Journal of the IGPL 28 (3):281-315.
    Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices, in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the axiom was replaced by the deontic axiom. In this paper, we propose even weaker systems, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  29. Epistemic Multilateral Logic.Luca Incurvati & Julian J. Schlöder - 2022 - Review of Symbolic Logic 15 (2):505-536.
    We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  30.  83
    Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL∀.Franco Montagna & Hiroakira Ono - 2002 - Studia Logica 71 (2):227-245.
    The present paper deals with the predicate version MTL of the logic MTL by Esteva and Godo. We introduce a Kripke semantics for it, along the lines of Ono''s Kripke semantics for the predicate version of FLew (cf. [O85]), and we prove a completeness theorem. Then we prove that every predicate logic between MTL and classical predicate logic is undecidable. Finally, we prove that MTL is complete with respect to the standard semantics, i.e., with respect to Kripke frames on (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  31. Fuzzy logics based on [0,1)-continuous uninorms.Dov Gabbay & George Metcalfe - 2007 - Archive for Mathematical Logic 46 (5-6):425-449.
    Axiomatizations are presented for fuzzy logics characterized by uninorms continuous on the half-open real unit interval [0,1), generalizing the continuous t-norm based approach of Hájek. Basic uninorm logic BUL is defined and completeness is established with respect to algebras with lattice reduct [0,1] whose monoid operations are uninorms continuous on [0,1). Several extensions of BUL are also introduced. In particular, Cross ratio logic CRL, is shown to be complete with respect to one special uninorm. A Gentzen-style hypersequent calculus (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  32.  16
    Weak Necessity on Weak Kleene Matrices.Fabrice Correia - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 73-90.
    A possible world semantics for standard modal languages is presented, where the valuation functions are allowed to be partial, the truth--functional connectives are interpreted according to weak Kleene matrices, and the necessity operator is given a "weak" interpretation. Completeness and incompleteness results for some (axiomatic) systems are then established. Extensions of these modal logics in which figure "statability" operators are also examined.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  33.  11
    Symétries Et Transvexions, Principalement Dans Les Groupes de Rang de Morley Fini Sans Involutions.Bruno Poizat - 2021 - Journal of Symbolic Logic 86 (3):965-990.
    The role played by the symmetric structure of a group of finite Morley rank without involutions in the proof by contradiction of Frécon 2018 was put in evidence in Poizat 2018; indeed, this proof consists in the construction of a symmetric space of dimension two (“a plane”), and then in showing that such a plane cannot exist.To a definable symmetric subset of such a group are associated symmetries and transvections, that we undertake here to study in the abstract, without mentioning (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  39
    Weakly associative relation algebras with projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.
    Built on the foundations laid by Peirce, Schröder, and others in the 19th century, the modern development of relation algebras started with the work of Tarski and his colleagues [21, 22]. They showed that relation algebras can capture strong first‐order theories like ZFC, and so their equational theory is undecidable. The less expressive class WA of weakly associative relation algebras was introduced by Maddux [7]. Németi [16] showed that WA's have a decidable universal theory. There has been extensive research (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35. On the semantics and logic of declaratives and interrogatives.Ivano Ciardelli, Jeroen Groenendijk & Floris Roelofsen - 2015 - Synthese 192 (6):1689-1728.
    In many natural languages, there are clear syntactic and/or intonational differences between declarative sentences, which are primarily used to provide information, and interrogative sentences, which are primarily used to request information. Most logical frameworks restrict their attention to the former. Those that are concerned with both usually assume a logical language that makes a clear syntactic distinction between declaratives and interrogatives, and usually assign different types of semantic values to these two types of sentences. A different approach has been taken (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  36.  22
    An infinitary propositional probability logic.Stefano Baratella - 2023 - Archive for Mathematical Logic 62 (3):291-320.
    We introduce a logic for a class of probabilistic Kripke structures that we call type structures, as they are inspired by Harsanyi type spaces. The latter structures are used in theoretical economics and game theory. A strong completeness theorem for an associated infinitary propositional logic with probabilistic operators was proved by Meier. By simplifying Meier’s proof, we prove that our logic is strongly complete with respect to the class of type structures. In order to do that, we define a canonical (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  53
    Categorial inference and modal logic.Natasha Kurtonina - 1998 - Journal of Logic, Language and Information 7 (4):399-411.
    This paper establishes a connection between structure sensitive categorial inference and classical modal logic. The embedding theorems for non-associative Lambek Calculus and the whole class of its weak Sahlqvist extensions demonstrate that various resource sensitive regimes can be modelled within the framework of unimodal temporal logic. On the semantic side, this requires decomposition of the ternary accessibility relation to provide its correlation with standard binary Kripke frames and models.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  38. Logics and algebras for multiple players.Loes Olde Loohuis & Yde Venema - 2010 - Review of Symbolic Logic 3 (3):485-519.
    We study a generalization of the standard syntax and game-theoretic semantics of logic, which is based on a duality between two players, to a multiplayer setting. We define propositional and modal languages of multiplayer formulas, and provide them with a semantics involving a multiplayer game. Our focus is on the notion of equivalence between two formulas, which is defined by saying that two formulas are equivalent if under each valuation, the set of players with a winning strategy is the (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  8
    A Victim of Its Own Success: Internationalization, Neoliberalism, and Organizational Involution at the Business Council of Australia.Stephen Bell - 2006 - Politics and Society 34 (4):543-570.
    The focus of this article is on the Business Council of Australia, an association of the CEOs of the 100 or so largest companies operating in Australia. Since its inception the BCA has been an influential supporter of largely successful efforts to neoliberalize and internationalize the Australian economy. Running in parallel with these developments, however, the BCA has moved from being a “somewhat strong” to a relatively weak policy organization. This article argues these two trends are causally related. Neoliberal-inspired (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  40.  86
    The Semantics and Proof Theory of Linear Logic.Arnon Avron - 1988 - Theoretical Computer Science 57 (2):161-184.
    Linear logic is a new logic which was recently developed by Girard in order to provide a logical basis for the study of parallelism. It is described and investigated in Gi]. Girard's presentation of his logic is not so standard. In this paper we shall provide more standard proof systems and semantics. We shall also extend part of Girard's results by investigating the consequence relations associated with Linear Logic and by proving corresponding str ong completeness theorems. Finally, we (...)
    Direct download  
     
    Export citation  
     
    Bookmark   64 citations  
  41.  74
    Weakly associative relation algebras with polyadic composition operations.Vera Stebletsova - 2000 - Studia Logica 66 (2):297-323.
    In this paper we introduced various classes of weakly associative relation algebras with polyadic composition operations. Among them is the class RWA of representable weakly associative relation algebras with polyadic composition operations. Algebras of this class are relativized representable relation algebras augmented with an infinite set of operations of increasing arity which are generalizations of the binary relative composition. We show that RWA is a canonical variety whose equational theory is decidable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  50
    Standard completeness theorem for ΠMTL.Rostislav Horĉík - 2005 - Archive for Mathematical Logic 44 (4):413-424.
    Abstract.ΠMTL is a schematic extension of the monoidal t-norm based logic (MTL) by the characteristic axioms of product logic. In this paper we prove that ΠMTL satisfies the standard completeness theorem. From the algebraic point of view, we show that the class of ΠMTL-algebras (bounded commutative cancellative residuated l-monoids) in the real unit interval [0,1] generates the variety of all ΠMTL-algebras.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  43. Logic, mathematics, physics: from a loose thread to the close link: Or what gravity is for both logic and mathematics rather than only for physics.Vasil Penchev - 2023 - Astrophysics, Cosmology and Gravitation Ejournal 2 (52):1-82.
    Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can be (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44. Nonassociative substructural logics and their semilinear extensions: Axiomatization and completeness properties: Nonassociative substructural logics.Petr Cintula, Rostislav Horčík & Carles Noguera - 2013 - Review of Symbolic Logic 6 (3):394-423.
    Substructural logics extending the full Lambek calculus FL have largely benefited from a systematical algebraic approach based on the study of their algebraic counterparts: residuated lattices. Recently, a nonassociative generalization of FL has been studied by Galatos and Ono as the logic of lattice-ordered residuated unital groupoids. This paper is based on an alternative Hilbert-style presentation for SL which is almost MP -based. This presentation is then used to obtain, in a uniform way applicable to most substructural logics, a form (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  45.  74
    Recovering Quantum Logic Within an Extended Classical Framework.Claudio Garola & Sandro Sozzo - 2013 - Erkenntnis 78 (2):399-419.
    We present a procedure which allows us to recover classical and nonclassical logical structures as concrete logics associated with physical theories expressed by means of classical languages. This procedure consists in choosing, for a given theory ${{\mathcal{T}}}$ and classical language ${{\fancyscript{L}}}$ expressing ${{\mathcal{T}}, }$ an observative sublanguage L of ${{\fancyscript{L}}}$ with a notion of truth as correspondence, introducing in L a derived and theory-dependent notion of C-truth (true with certainty), defining a physical preorder $\prec$ induced by C-truth, and finally selecting (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46. The logic of distributive bilattices.Félix Bou & Umberto Rivieccio - 2011 - Logic Journal of the IGPL 19 (1):183-216.
    Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  47. The logic of metabolism and its fuzzy consequences.A. Danchin - 2014 - Environmental Microbiology 16 (1):19-28.
    Intermediary metabolism molecules are orchestrated into logical pathways stemming from history (L-amino acids, D-sugars) and dynamic constraints (hydrolysis of pyrophosphate or amide groups is the driving force of anabolism). Beside essential metabolites, numerous variants derive from programmed or accidental changes. Broken down, variants enter standard pathways, producing further variants. Macromolecule modification alters enzyme reactions specificity. Metabolism conform thermodynamic laws, precluding strict accuracy. Hence, for each regular pathway, a wealth of variants inputs and produces metabolites that are similar to but (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  66
    Strong paraconsistency and the basic constructive logic for an even weaker sense of consistency.Gemma Robles & José M. Méndez - 2009 - Journal of Logic, Language and Information 18 (3):357-402.
    In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F -consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49. Expressive Power and Incompleteness of Propositional Logics.James W. Garson - 2010 - Journal of Philosophical Logic 39 (2):159-171.
    Natural deduction systems were motivated by the desire to define the meaning of each connective by specifying how it is introduced and eliminated from inference. In one sense, this attempt fails, for it is well known that propositional logic rules underdetermine the classical truth tables. Natural deduction rules are too weak to enforce the intended readings of the connectives; they allow non-standard models. Two reactions to this phenomenon appear in the literature. One is to try to restore the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  50.  28
    The Logic of Plurality. [REVIEW]B. W. A. - 1972 - Review of Metaphysics 25 (3):549-549.
    Among the quantificational notions neglected by classical logic are "many," "few," and "nearly all." Despite the apparent vagueness associated with these terms in ordinary discourse, in specific contexts we can and do draw strict inferences from statements in which they occur. In this pioneering work, Altham has attempted to uncover something of the formal logic that justifies such inferences. He begins by showing the mutual interdefinability of the three terms. If negation and any one of them are taken as primitive, (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 966