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ł:
On the Leibniz congruences
Autorzy:
Font, Josep
Powiązania:
https://bibliotekanauki.pl/articles/1361077.pdf
Data publikacji:
1993
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
deductive system
protoalgebraic logic
Gentzen calculus
closure operator
abstract logic
algebraizable logic
Leibniz congruence
selfextensional logic
logical matrices
algebraic logic
Opis:
The aim of this paper is to discuss the motivation for a new general algebraic semantics for deductive systems, to introduce it, and to present an outline of its main features. Some tools from the theory of abstract logics are also introduced, and two classifications of deductive systems are analysed: one is based on the behaviour of the Leibniz congruence (the maximum congruence of a logical matrix) and the other on the behaviour of the Frege operator (which associates to every theory the interderivability relation modulo the theory). For protoalgebraic deductive systems the class of algebras associated in general turns out to be the class of algebra reducts of reduced matrices, which is the algebraic counterpart usually considered for this large class of deductive systems; but in the general case the new class of algebras shows a better behaviour.
Źródło:
Banach Center Publications; 1993, 28, 1; 17-36
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Polyadic algebras over nonclassical logics
Autorzy:
Pigozzi, Don
Salibra, Antonino
Powiązania:
https://bibliotekanauki.pl/articles/1361079.pdf
Data publikacji:
1993
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
lambda calculus
modal logic
intuitionistic logic
many-valued logic
BCK logic
Opis:
The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)'s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Łukasiewicz, modal logics that admit the rule of necessitation, BCK logic, etc.
Źródło:
Banach Center Publications; 1993, 28, 1; 51-66
0137-6934
Pojawia się w:
Banach Center Publications
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ł:
On Undecidability of Non-monotonic Logic
Autorzy:
Suchenek, M. A.
Powiązania:
https://bibliotekanauki.pl/articles/92958.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
default logic
autoepistemic logic
asymptotic decidability
Opis:
The degree of undecidability of nonmonotonic logic is investigated. A proof is provided that arithmetical but not recursively enumerable sets of sentences definable by nonmonotonic default logic are elements of ∆n+1 but not Σ n nor Π n for some n ≥1 in Kleene- Mostowski hierarchy of arithmetical sets.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 127-132
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From quantum logic to quantum computational logic
Autorzy:
Caponigro, M.
Mancini, S.
Powiązania:
https://bibliotekanauki.pl/articles/1955359.pdf
Data publikacji:
2006
Wydawca:
Politechnika Gdańska
Tematy:
quantum logic
quantum computation
Opis:
We overview the main concepts of quantum logic ranging from the orthodox formulation to the quantum computational aspects.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2006, 10, 1; 5-19
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
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ł:
Logic and its Pragmatic Aspects
Autorzy:
Marsonet, Michele
Powiązania:
https://bibliotekanauki.pl/articles/1037570.pdf
Data publikacji:
2018
Wydawca:
Academicus. International Scientific Journal publishing house
Tematy:
logic
formal logic
logical pluralism
pragmatism
analytic philosophy
praxis
Opis:
A pragmatist conception of logic rejects any kind of logical constructionism, based on the appeal to privileged ontological and epistemological items and to a perfect language supposedly provided by mathematical logic. Even in logic, “pluralism” must be the key-word if one does not want to be locked in the cage of conceptions that become rapidly outdated. Dealing with the dichotomy Absolutism/Relativism in logic, it may be observed that the enterprise of logic can be considered in several - and substantially different - perspectives, among which we find (1) the psychologistic, (2) the Platonistic, and (3) the instrumentalistic viewpoints. According to (1) logic is viewed as fundamentally descriptive, and its task is taken to be that of outlining a “theory of reasoning,” i.e. a systematic account of how we humans proceed when reasoning successufully. According to (3), instead, logic’s task is that of constructing rigorous systems codifying not only actual, but also possible instrumentalities for conducting valid inferences, and these would be available (should someone want to avail himself to them) for adoption as an organon of reasoning, but no empirical claims are made that anyone has (or will) avail himself of this opportunity. The logician devises a tool or instrument for correct reasoning, but does not concern himself about the uses of this instrument. Philosophy and logic cannot be linked so closely, and today the idea that the analytic style of philosophizing is just one style among many others, and not the only possible one, is gaining increasing acceptance.
Źródło:
Academicus International Scientific Journal; 2018, 17; 46-53
2079-3715
2309-1088
Pojawia się w:
Academicus International Scientific Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The logic dual to Sobocińskis n-valued logic
Autorzy:
Górnicka, A.
Powiązania:
https://bibliotekanauki.pl/articles/121938.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
n-valued Sobociński logic
logical matrix
matryca logiczna
Opis:
In this paper, we describe the logic dual to n-valued Sobociński logic. According to the idea presented by Malinowski and Spasowski [1], we introduce the consequence dual to the consequence of n-valued Sobociński logic in two ways: by a logical matrix and by a set of rules of inference. Then we prove that both approaches are equivalent and the consequence is dual in Wójcicki sense (see [3]).
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2010, 15; 35-42
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
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ł:
High-Performance Ternary (4:2) Compressor Based on Capacitive Threshold Logic
Autorzy:
Mirzaee, R. F.
Reza, A.
Powiązania:
https://bibliotekanauki.pl/articles/225977.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
4:2 compressor
ternary logic
multiple-valued logic
CNFET
threshold logic
Opis:
This paper presents a ternary (4:2) compressor, which is an important component in multiplication. However, the structure differs from the binary counterpart since the ternary model does not require carry signals. The method of capacitive threshold logic (CTL) is used to achieve the output signals directly. Unlike the previously presented similar structure, the entire capacitor network is divided into two parts. This segregation results in higher reliability and robustness against unwanted process, voltage, and temperature (PVT) variations. Simulations are performed by HSPICE and 32nm CNFET technology. Simulation results demonstrate about 94% higher performance in terms of power-delay product (PDP) for the new design over the previous one.
Źródło:
International Journal of Electronics and Telecommunications; 2017, 63, 4; 355-361
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Abstract logical structuralism
Autorzy:
Marquis, Jean-Pierre
Powiązania:
https://bibliotekanauki.pl/articles/1047597.pdf
Data publikacji:
2020-12-29
Wydawca:
Copernicus Center Press
Tematy:
philosophy
logic
structuralism
categorical logic
Opis:
Structuralism has recently moved center stage in philosophy of mathematics. One of the issues discussed is the underlying logic of mathematical structuralism. In this paper, I want to look at the dual question, namely the underlying structures of logic. Indeed, from a mathematical structuralist standpoint, it makes perfect sense to try to identify the abstract structures underlying logic. We claim that one answer to this question is provided by categorical logic. In fact, we claim that the latter can be seen—and probably should be seen—as being a structuralist approach to logic and it is from this angle that categorical logic is best understood.
Źródło:
Zagadnienia Filozoficzne w Nauce; 2020, 69; 67-110
0867-8286
2451-0602
Pojawia się w:
Zagadnienia Filozoficzne w Nauce
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ł

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