Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "logic" wg kryterium: Wszystkie pola


Tytuł:
Equality Logic
Autorzy:
Ghorbani, Shokoofeh
Powiązania:
https://bibliotekanauki.pl/articles/1023179.pdf
Data publikacji:
2020-11-04
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
many-valued logic
equality logic
completness
prelinear equality∆-algebra
prelinear equality∆ logic
Opis:
In this paper, we introduce and study a corresponding logic to equality-algebras and obtain some basic properties of this logic. We prove the soundness and completeness of this logic based on equality-algebras and local deduction theorem. We show that this logic is regularly algebraizable with respect to the variety of equality∆-algebras but it is not Fregean. Then we introduce the concept of (prelinear) equality∆-algebras and investigate some related properties. Also, we study ∆-deductive systems of equality∆-algebras. In particular, we prove that every prelinear equality ∆-algebra is a subdirect product of linearly ordered equality∆-algebras. Finally, we construct prelinear equality ∆ logic and prove the soundness and strong completeness of this logic respect to prelinear equality∆-algebras.
Źródło:
Bulletin of the Section of Logic; 2020, 49, 3; 291-324
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Monadic Fragments of Intuitionistic Control Logic
Autorzy:
Glenszczyk, Anna
Powiązania:
https://bibliotekanauki.pl/articles/749902.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Intuitionistic Control Logic
Intuitionistic Logic
Combining Logic
Control Operators
Opis:
We investigate monadic fragments of Intuitionistic Control Logic (ICL), which is obtained from Intuitionistic Propositional Logic (IPL) by extending language of IPL by a constant distinct from intuitionistic constants. In particular we present the complete description of purely negational fragment and show that most of monadic fragments are finite.
Źródło:
Bulletin of the Section of Logic; 2016, 45, 3/4
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Useful Four-Valued Extension of the Temporal Logic KtT4
Autorzy:
Degauquier, Vincent
Powiązania:
https://bibliotekanauki.pl/articles/749896.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
temporal logic
many-valued logic
bi-intuitionistic logic
paraconsistent logic
sequent calculus
duality
cut-redundancy
Opis:
The temporal logic KtT4 is the modal logic obtained from the minimal temporal logic Kt by requiring the accessibility relation to be reflexive (which corresponds to the axiom T) and transitive (which corresponds to the axiom 4). This article aims, firstly, at providing both a model-theoretic and a proof-theoretic characterisation of a four-valued extension of the temporal logic KtT4 and, secondly, at identifying some of the most useful properties of this extension in the context of partial and paraconsistent logics.
Źródło:
Bulletin of the Section of Logic; 2018, 47, 1
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From Intuitionism to Brouwers Modal Logic
Autorzy:
Kostrzycka, Zofia
Powiązania:
https://bibliotekanauki.pl/articles/1023286.pdf
Data publikacji:
2020-12-30
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
intuitionistic logic
Kripke frames
Brouwer's modal logic
Opis:
We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication, whereas variables and other positive sentences remain as they are. The proposed translation preserves fragments of the Rieger-Nishimura lattice which is the Lindenbaum algebra of monadic formulas in INT. Unfortunately, INT is not embedded by this mapping into KTB.
Źródło:
Bulletin of the Section of Logic; 2020, 49, 4; 343-358
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nilpotent Minimum Logic NM and Pretabularity
Autorzy:
Yang, Eunsuk
Powiązania:
https://bibliotekanauki.pl/articles/750006.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
pretabularity
nilpotent minimum logic
algebraic semantics
fuzzy logic
finite model property
Opis:
This paper deals with pretabularity of fuzzy logics. For this, we first introduce two systems NMnfp and NM½, which are expansions of the fuzzy system NM (Nilpotent minimum logic), and examine the relationships between NMnfp and the another known extended system NM-. Next, we show that NMnfp and NM½ are pretabular, whereas NM is not. We also discuss their algebraic completeness.  
Źródło:
Bulletin of the Section of Logic; 2020, 49, 1
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Note on the Intuitionistic Logic of False Belief
Autorzy:
Witczak, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/2142756.pdf
Data publikacji:
2021-09-01
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Intuitionistic modal logic
non-normal modal logic
neighborhood semantics
Opis:
In this paper we analyse logic of false belief in the intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula $\varphi$ is not satisfied in a given world, but we still believe in it (or we think that it should be accepted). Another interpretations are also possible: e.g. that we do not accept $\varphi$ but it is imposed on us by a kind of council or advisory board. From the mathematical point of view, the idea is expressed by an adequate form of modal operator $\mathsf{W}$ which is interpreted in relational frames with neighborhoods. We discuss monotonicity of forcing, soundness, completeness and several other issues. Finally, we mention the fact that it is possible to investigate intuitionistic logics of unknown truths.
Źródło:
Bulletin of the Section of Logic; 2022, 51, 1; 57-71
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Variant of Material Connexive Logic
Autorzy:
Belikov, Alexander
Zaitsev, Dmitry
Powiązania:
https://bibliotekanauki.pl/articles/2142753.pdf
Data publikacji:
2021-11-09
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
many-valued logics
connexive logic
four-valued logic MC
informal reasoning
Opis:
The relationship between formal (standard) logic and informal (common-sense, everyday) reasoning has always been a hot topic. In this paper, we propose another possible way to bring it up inspired by connexive logic. Our approach is based on the following presupposition: whatever method of formalizing informal reasoning you choose, there will always be some classically acceptable deductive principles that will have to be abandoned, and some desired schemes of argument that clearly are not classically valid. That way, we start with a new version of connexive logic which validates Boethius’ (and thus, Aristotle’s) Theses and quashes their converse from right to left. We provide a sound and complete axiomatization of this logic. We also study the implication-negation fragment of this logic supplied with Boolean negation as a second negation.
Źródło:
Bulletin of the Section of Logic; 2022, 51, 2; 227-242
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Arithmetically Complete Predicate Modal Logic
Autorzy:
Hao, Yunge
Tourlakis, George
Powiązania:
https://bibliotekanauki.pl/articles/2033850.pdf
Data publikacji:
2021-08-23
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Predicate modal logic
arithmetic completeness
logic GL
Solovay's theorem
equational proofs
Opis:
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly the history that led to \(\textup{ML}^3\), its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ``formulators'' tool. Its semantic completeness (with respect to finite reverse well-founded Kripke models) is fully stated in the current paper and the proof is retold here. Applying the Solovay technique to those models the present paper establishes its main result, namely, that \(\textup{ML}^3\) is arithmetically complete. As expanded below, \(\textup{ML}^3\) is a first-order modal logic that along with its built-in ability to simulate general classical first-order provability―"\(\Box\)" simulating the the informal classical "\(\vdash\)"―is also arithmetically complete in the Solovay sense.
Źródło:
Bulletin of the Section of Logic; 2021, 50, 4; 513-541
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Deontic Paradoxes and Tableau System for Kalinowski’s Deontic Logic K1
Autorzy:
Ciuciura, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/750004.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
deontic logic
K1
Kalinowski’s logic
paradoxes
tableaux
Opis:
In 1953, Jerzy Kalinowski published his paper on the logic of normative sentences. The paper is recognized as one of the first publications on the formal system of deontic logic. The aim of this paper is to present a tableau system for Kalinowski’s deontic logic and to discuss some of the topics related to the paradoxes of deontic logic.
Źródło:
Bulletin of the Section of Logic; 2017, 46, 3/4
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Autorzy:
Płaczek, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/1023344.pdf
Data publikacji:
2020-11-13
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Substructural logic
Lambek calculus
nonassociative linear logic
sequent system
PTime complexity
Opis:
Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic. Here we prove an analogous result for the nonassociative version of this logic. Like Lambek, we consider a left-sided system, but the result also holds for its right-sided version, by a natural symmetry. The treatment of nonassociative sequent systems involves some subtleties, not appearing in associative logics. We also prove the PTime complexity of the multiplicative fragment of NBL.
Źródło:
Bulletin of the Section of Logic; 2021, 50, 1; 55-80
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Post-style proof of completeness theorem for symmetric relatedness Logic S
Autorzy:
Klonowski, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/749984.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
normal forms
Post-style proof of completeness
relatedness logic
relating logic
Opis:
One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.
Źródło:
Bulletin of the Section of Logic; 2018, 47, 3
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Alternative Natural Deduction for the Intuitionistic Propositional Logic
Autorzy:
Ilić, Mirjana
Powiązania:
https://bibliotekanauki.pl/articles/749978.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
natural deduction
intuitionistic logic
Opis:
A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus derivations to natural deduction derivations and back.
Źródło:
Bulletin of the Section of Logic; 2016, 45, 1
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Sound Interpretation of Leśniewskis Epsilon in Modal Logic KTB
Autorzy:
Inoue, Takao
Powiązania:
https://bibliotekanauki.pl/articles/2033852.pdf
Data publikacji:
2021-11-09
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Le´sniewski’s ontology
propositional ontology
translation
interpretation
modal logic
KTB
soundness
Grzegorczyk’s modal logic
Opis:
In this paper, we shall show that the following translation \(I^M\) from the propositional fragment \(\bf L_1\) of Leśniewski's ontology to modal logic \(\bf KTB\) is sound: for any formula \(\phi\) and \(\psi\) of \(\bf L_1\), it is defined as (M1) \(I^M(\phi \vee \psi) = I^M(\phi) \vee I^M(\psi)\), (M2) \(I^M(\neg \phi) = \neg I^M(\phi)\), (M3) \(I^M(\epsilon ab) = \Diamond p_a \supset p_a . \wedge . \Box p_a \supset \Box p_b .\wedge . \Diamond p_b \supset p_a\), where \(p_a\) and \(p_b\) are propositional variables corresponding to the name variables \(a\) and \(b\), respectively. In the last, we shall give some comments including some open problems and my conjectures.
Źródło:
Bulletin of the Section of Logic; 2021, 50, 4; 455-463
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Four-valued expansions of Dunn-Belnaps logic (I): Basic characterizations
Autorzy:
Pynko, Alexej P.
Powiązania:
https://bibliotekanauki.pl/articles/1023300.pdf
Data publikacji:
2020-12-30
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
propositional logic
logical matrix
Dunn-Belnap's logic
expansion
[bounded] distributive/De Morgan lattice
equality determinant
Opis:
Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique (up to isomorphism) conjunctive matrix ℳ4 with exactly two distinguished values over an expansion 4 of a De Morgan non-Boolean four-valued diamond, but by no matrix with either less than four values or a single [non-]distinguished value, and has no proper extension satisfying Variable Sharing Property (VSP). We then characterize L4's having a theorem / inconsistent formula, satisfying VSP and being [inferentially] maximal / subclassical / maximally paraconsistent, in particular, algebraically through ℳ4|4's (not) having certain submatrices|subalebras. Likewise, [providing 4 is regular / has no three-element subalgebra] L4 has a proper consistent axiomatic extension if[f] ℳ4 has a proper paraconsistent / two-valued submatrix [in which case the logic of this submatrix is the only proper consistent axiomatic extension of L4 and is relatively axiomatized by the Excluded Middle law axiom]. As a generic tool (applicable, in particular, to both classically-negative and implicative expansions of DB4), we also prove that the lattice of axiomatic extensions of the logic of an implicative matrix ℳ with equality determinant is dual to the distributive lattice of lower cones of the set of all submatrices of ℳ with non-distinguished values.
Źródło:
Bulletin of the Section of Logic; 2020, 49, 4; 401-437
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Categorical Abstract Logic: Hidden Multi-Sorted Logics as Multi-Term π-Institutions
Autorzy:
Voutsadakis, George
Powiązania:
https://bibliotekanauki.pl/articles/749924.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Behavioral Equivalence
Hidden Logic
Multi-Sorted Logic
Multi-term π-Institutions
Interpretability
Deductive Equivalence
Opis:
Babenyshev and Martins proved that two hidden multi-sorted deductive systems are deductively equivalent if and only if there exists an isomorphism between their corresponding lattices of theories that commutes with substitutions. We show that the π-institutions corresponding to the hidden multi-sorted deductive systems studied by Babenyshev and Martins satisfy the multi-term condition of Gil-F´erez. This provides a proof of the result of Babenyshev and Martins by appealing to the general result of Gil-F´erez pertaining to arbitrary multi-term π-institutions. The approach places hidden multi-sorted deductive systems in a more general framework and bypasses the laborious reuse of well-known proof techniques from traditional abstract algebraic logic by using “off the shelf” tools.
Źródło:
Bulletin of the Section of Logic; 2016, 45, 2
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies