Zaloguj się

Gotowe bibliografie tematyczne / Paraconsistent modal logics / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Paraconsistent modal logics.

Artykuły w czasopismach na temat „Paraconsistent modal logics”

Autor: Grafiati

Data publikacji: 8 czerwca 2024

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Paraconsistent modal logics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Rivieccio, Umberto. "Paraconsistent Modal Logics." Electronic Notes in Theoretical Computer Science 278 (November 2011): 173–86. http://dx.doi.org/10.1016/j.entcs.2011.10.014.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Avron, Arnon, and Anna Zamansky. "Paraconsistency, self-extensionality, modality." Logic Journal of the IGPL 28, no. 5 (2018): 851–80. http://dx.doi.org/10.1093/jigpal/jzy064.

Pełny tekst źródła

Streszczenie:

Abstract Paraconsistent logics are logics that, in contrast to classical and intuitionistic logic, do not trivialize inconsistent theories. In this paper we take a paraconsistent view on two famous modal logics: B and S5. We use for this a well-known general method for turning modal logics to paraconsistent logics by defining a new (paraconsistent) negation as $\neg \varphi =_{Def} \sim \Box \varphi$ (where $\sim$ is the classical negation). We show that while that makes both B and S5 members of the well-studied family of paraconsistent C-systems, they differ from most other C-systems in havin

Style APA, Harvard, Vancouver, ISO itp.

3

ROBLES, GEMMA, and JOSÉ M. MÉNDEZ. "PARACONSISTENT LOGICS INCLUDED IN LEWIS’ S4." Review of Symbolic Logic 3, no. 3 (2010): 442–66. http://dx.doi.org/10.1017/s1755020310000109.

Pełny tekst źródła

Streszczenie:

As is known, a logic S is paraconsistent if the rule ECQ (E contradictione quodlibet) is not a rule of S. Not less well known is the fact that Lewis’ modal logics are not paraconsistent. Actually, Lewis vindicates the validity of ECQ in a famous proof currently known as the “Lewis’ proof” or “Lewis’ argument.” This proof essentially leans on the Disjunctive Syllogism as a rule of inference. The aim of this paper is to define a series of paraconsistent logics included in S4 where the Disjunctive Syllogism is valid only as a rule of proof.

Style APA, Harvard, Vancouver, ISO itp.

4

Oliveira, Kleidson Êglicio Carvalho da Silva. "Paraconsistent Logic Programming in Three and Four-Valued Logics." Bulletin of Symbolic Logic 28, no. 2 (2022): 260. http://dx.doi.org/10.1017/bsl.2021.34.

Pełny tekst źródła

Streszczenie:

AbstractFrom the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well stu

Style APA, Harvard, Vancouver, ISO itp.

5

Odintsov, Sergei P., and Heinrich Wansing. "Disentangling FDE-Based Paraconsistent Modal Logics." Studia Logica 105, no. 6 (2017): 1221–54. http://dx.doi.org/10.1007/s11225-017-9753-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Карниэлли, У. "Formal polynomials, heuristics and proofs in logic." Logical Investigations 16 (April 7, 2010): 280–94. http://dx.doi.org/10.21146/2074-1472-2010-16-0-280-294.

Pełny tekst źródła

Streszczenie:

This note surveys some previous results on the role of formal polynomials as a representation method for logical derivation in classical and non-classical logics, emphasizing many-valued logics, paraconsistent logics and modal logics. It also discusses the potentialities of formal polynomials as heuristic devices in logic and for expressing certain meta-logical properties, as well as pointing to some promising generalizations towards algebraic geometry.

Style APA, Harvard, Vancouver, ISO itp.

7

Маркин, В. И. "What trends in non-classical logic were anticipated by Nikolai Vasiliev?" Logical Investigations 19 (April 9, 2013): 122–35. http://dx.doi.org/10.21146/2074-1472-2013-19-0-122-135.

Pełny tekst źródła

Streszczenie:

In this paper we discuss a question about the trends in non-classical logic that were exactly anticipated by Niko- lai Vasiliev. We show the influence of Vasiliev’s Imaginary logic on paraconsistent logic. Metatheoretical relations between Vasiliev’s logical systems and many-valued predicate logics are established. We also make clear that Vasiliev has developed a sketch of original system of intensional logic and expressed certain ideas of modal and temporal logics.

Style APA, Harvard, Vancouver, ISO itp.

8

McGinnis, Casey. "Tableau Systems for Some Paraconsistent Modal Logics." Electronic Notes in Theoretical Computer Science 143 (January 2006): 141–57. http://dx.doi.org/10.1016/j.entcs.2005.05.028.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Indrzejczak, Andrzej, and Yaroslav Petrukhin. "Uniform Cut-Free Bisequent Calculi for Three-Valued Logics." Logic and Logical Philosophy 33, no. 3 (2024): 463–506. http://dx.doi.org/10.12775/llp.2024.019.

Pełny tekst źródła

Streszczenie:

We present a uniform characterisation of three-valued logics by means of a bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as the weakest kind of system in the rich family of generalised SC operating on items being some collections of ordinary sequents, like hypersequent and nested sequent calculi. It seems that for many non-classical logics, including some many-valued, paraconsistent and modal logics, the reasonably modest generalisation of standard SC offered by BSC is sufficient.

Style APA, Harvard, Vancouver, ISO itp.

10

Béziau, Jean-Yves. "Many-valuedness from a universal logic perspective." Logical Investigations 26, no. 1 (2020): 78–90. http://dx.doi.org/10.21146/2074-1472-2020-26-1-78-90.

Pełny tekst źródła

Streszczenie:

   We start by presenting various ways to define and to talk about many-valued logic(s). We make the distinction between on the one hand the class of many-valued logics and on the other hand what we call “many-valuedness”: the meta-theory of many-valued logics and the related meta-theoretical framework that is useful for the study of any logical systems. We point out that universal logic, considered as a general theory of logical systems, can be seen as an extension of many-valuedness. After a short story of many-valuedness, stressing that it is present since the beginning of

Style APA, Harvard, Vancouver, ISO itp.

11

Coscarelli, Bruno Costa. "Model Theory in a Paraconsistent Environment." Bulletin of Symbolic Logic 27, no. 2 (2021): 216. http://dx.doi.org/10.1017/bsl.2021.33.

Pełny tekst źródła

Streszczenie:

AbstractThe purpose of this thesis is to develop a paraconsistent Model Theory. The basis for such a theory was launched by Walter Carnielli, Marcelo Esteban Coniglio, Rodrigo Podiack, and Tarcísio Rodrigues in the article ‘On the Way to a Wider Model Theory: Completeness Theorems for First-Order Logics of Formal Inconsistency’ [The Review of Symbolic Logic, vol. 7 (2014)].Naturally, a complete theory cannot be fully developed in a single work. Indeed, the goal of this work is to show that a paraconsistent Model Theory is a sound and worthy possibility. The pursuit of this goal is divided in t

Style APA, Harvard, Vancouver, ISO itp.

12

CARNIELLI, WALTER, MARCELO E. CONIGLIO, RODRIGO PODIACKI, and TARCÍSIO RODRIGUES. "ON THE WAY TO A WIDER MODEL THEORY: COMPLETENESS THEOREMS FOR FIRST-ORDER LOGICS OF FORMAL INCONSISTENCY." Review of Symbolic Logic 7, no. 3 (2014): 548–78. http://dx.doi.org/10.1017/s1755020314000148.

Pełny tekst źródła

Streszczenie:

AbstractThis paper investigates the question of characterizing first-orderLFIs (logics of formal inconsistency) by means of two-valued semantics.LFIs are powerful paraconsistent logics that encode classical logic and permit a finer distinction between contradictions and inconsistencies, with a deep involvement in philosophical and foundational questions. Although focused on just one particular case, namely, the quantified logicQmbC, the method proposed here is completely general for this kind of logics, and can be easily extended to a large family of quantified paraconsistent logics, supplying

Style APA, Harvard, Vancouver, ISO itp.

13

Kamide, Norihiro, and Daiki Koizumi. "Method for Combining Paraconsistency and Probability in Temporal Reasoning." Journal of Advanced Computational Intelligence and Intelligent Informatics 20, no. 5 (2016): 813–27. http://dx.doi.org/10.20965/jaciii.2016.p0813.

Pełny tekst źródła

Streszczenie:

Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic (pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is proven, thereby indicating that we can reuse existing pCTL-based mo

Style APA, Harvard, Vancouver, ISO itp.

14

Schwind, Nicolas, Sébastien Konieczny, and Ramón Pino Pérez. "On Paraconsistent Belief Revision in LP." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (2022): 5879–87. http://dx.doi.org/10.1609/aaai.v36i5.20532.

Pełny tekst źródła

Streszczenie:

Belief revision aims at incorporating, in a rational way, a new piece of information into the beliefs of an agent. Most works in belief revision suppose a classical logic setting, where the beliefs of the agent are consistent. Moreover, the consistency postulate states that the result of the revision should be consistent if the new piece of information is consistent. But in real applications it may easily happen that (some parts of) the beliefs of the agent are not consistent. In this case then it seems reasonable to use paraconsistent logics to derive sensible conclusions from these inconsist

Style APA, Harvard, Vancouver, ISO itp.

15

Béziau, Jean-Yves. "Paraconsistent logic from a modal viewpoint." Journal of Applied Logic 3, no. 1 (2005): 7–14. http://dx.doi.org/10.1016/j.jal.2004.07.009.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Huang, Shasha, Jing Hao, and Dang Luo. "Incoherency Problems in a Combination of Description Logics and Rules." Journal of Applied Mathematics 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/604753.

Pełny tekst źródła

Streszczenie:

A paraconsistent semantics has been presented for hybrid MKNF knowledge bases—a combination method for description logics and rules. However, it is invalid when incoherency occurs in the knowledge base. In this paper, we introduce a semi-S5semantics for hybrid MKNF knowledge bases on the basis of nine-valued lattice, such that it is paraconsistent for incoherent knowledge base. It is shown that a semi-S5model can be computed via a fixpoint operator and is in fact a paraconsistent MKNF model when the knowledge base is incoherent. Moreover, we apply six-valued lattice to hybrid MKNF knowledge ba

Style APA, Harvard, Vancouver, ISO itp.

17

BAGAI, RAJIV, and RAJSHEKHAR SUNDERRAMAN. "COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 04, no. 02 (1996): 157–75. http://dx.doi.org/10.1142/s021848859600010x.

Pełny tekst źródła

Streszczenie:

The well-founded model is one of the most popular models of general logic programs, i.e. logic programs with negation in the bodies of clauses. We present a method for constructing this model for general deductive databases, which are logic programs without any function symbols. The method adopts paraconsistent relations as the semantic objects associated with the predicate symbols of the database. Paraconsistent relations are a generalization of ordinary relations in that they allow manipulation of incomplete as well as inconsistent information. The first step in the model construction method

Style APA, Harvard, Vancouver, ISO itp.

18

Esser, Olivier. "A Strong Model of Paraconsistent Logic." Notre Dame Journal of Formal Logic 44, no. 3 (2003): 149–56. http://dx.doi.org/10.1305/ndjfl/1091030853.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Omori, Hitoshi, and Igor Sedlar. "A note on formalizing discussive logic." Australasian Journal of Logic 22, no. 1 (2025): 33–43. https://doi.org/10.26686/ajl.v22i2.6800.

Pełny tekst źródła

Streszczenie:

Discussive logic was introduced by Jaskowski as a logic of discussion. In this note we show that some natural translation-based formalizations of discussive logic in modal logic do not yield a paraconsistent logic but rather classical logic. Some alternative modal formalizations of discussive logic that avoid the collapse into classical logic are put forward.

Style APA, Harvard, Vancouver, ISO itp.

20

Apostoli, Peter. "Modal Aggregation and the Theory of Paraconsistent Filters." Mathematical Logic Quarterly 42, no. 1 (1996): 175–90. http://dx.doi.org/10.1002/malq.19960420115.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Mendonça, Bruno R., and Walter A. Carnielli. "Fraïssé’s theorem for logics of formal inconsistency." Logic Journal of the IGPL 28, no. 5 (2018): 1060–72. http://dx.doi.org/10.1093/jigpal/jzy073.

Pełny tekst źródła

Streszczenie:

Abstract We prove that the minimal Logic of Formal Inconsistency (LFI) $\mathsf{QmbC}$ (basic quantified logic of formal inconsistency) validates a weaker version of Fraïssé’s theorem (FT). LFIs are paraconsistent logics that relativize the Principle of Explosion only to consistent formulas. Now, despite the recent interest in LFIs, their model-theoretic properties are still not fully understood. Our aim in this paper is to investigate the situation. Our interest in FT has to do with its fruitfulness; the preservation of FT indicates that a number of other classical semantic properties can be

Style APA, Harvard, Vancouver, ISO itp.

22

João Inácio da Silva Filho. "Application of Shannon Entropy in the Construction of a Paraconsistent Model of the Atom." JOURNAL OF ADVANCES IN PHYSICS 18 (October 11, 2020): 78–113. http://dx.doi.org/10.24297/jap.v18i.8873.

Pełny tekst źródła

Streszczenie:

In this paper, we present a model of the atom that is based on a nonclassical logic called paraconsistent logic (PL), which has the main property of accepting the contradiction in logical interpretations without the conclusions being annulled. The proposed model is constructed with an extension of PL called paraconsistent annotated logic with annotation of two values (PAL2v), which is associated with an interlaced lattice of four vertices. We use the logarithmic function of the Shannon entropy H(s) to construct the paraconsistent equations and thus adopt a probabilistic model for representatio

Style APA, Harvard, Vancouver, ISO itp.

23

Martinez, Angel Antonio Gonzalez, Irenilza de Alencar Nääs, Thayla Morandi Ridolfi de Carvalho-Curi та Jair Minoro Abe. "Applying Paraconsistent Annotated Logic Eτ for Optimizing Broiler Housing Conditions". AgriEngineering 6, № 2 (2024): 1252–65. http://dx.doi.org/10.3390/agriengineering6020071.

Pełny tekst źródła

Streszczenie:

Broilers are particularly sensitive to heat stress, which can impair growth, and lower conversion efficiency and survival rates. Under a climate change scenario, maintaining optimal thermal conditions within broiler houses becomes more complex and energy-intensive. Climate change can worsen air quality issues inside broiler houses by increasing the concentration of harmful gases, and proper mechanical ventilation systems are essential for diluting and removing these gases. The present study aimed to develop and validate a model for the ideal broiler housing strategy by applying the Paraconsist

Style APA, Harvard, Vancouver, ISO itp.

24

Shalack, Vladimir I. "On the origins of logical pluralism." Philosophy Journal 15, no. 4 (2022): 88–97. http://dx.doi.org/10.21146/2072-0726-2022-15-4-88-97.

Pełny tekst źródła

Streszczenie:

The article presents a brief analysis of how the existence of various logics became possible. This is shown on the example of such well-known logical theories as syllogistics, temporal, multivalued, intuitionistic, paraconsistent and quantum logics. Each of them arose not on someone’s whim, but to solve specific problems. They are based on the most general ontological assumptions about the subject area under study. In formal logic ontological assumptions are refined in the concept of a model structure. Since it is impossible to talk about logic in isolation from the language used, the most g

Style APA, Harvard, Vancouver, ISO itp.

25

GAO, TIANTIAN, PAUL FODOR, and MICHAEL KIFER. "Paraconsistency and word puzzles." Theory and Practice of Logic Programming 16, no. 5-6 (2016): 703–20. http://dx.doi.org/10.1017/s1471068416000326.

Pełny tekst źródła

Streszczenie:

AbstractWord puzzles and the problem of their representations in logic languages have received considerable attention in the last decade (Ponnuruet al. 2004; Shapiro 2011; Baral and Dzifcak 2012; Schwitter 2013). Of special interest is the problem of generating such representations directly from natural language (NL) or controlled natural language (CNL). An interesting variation of this problem, and to the best of our knowledge, scarcely explored variation in this context, is when the input information is inconsistent. In such situations, the existing encodings of word puzzles produce inconsis

Style APA, Harvard, Vancouver, ISO itp.

26

Strasser, Christian, and Sanderson Molick Silva. "Minimal-Inconsistency Tolerant Logics: A Quantitative Approach." Australasian Journal of Logic 22, no. 3 (2025): 308–65. https://doi.org/10.26686/ajl.v22i3.6718.

Pełny tekst źródła

Streszczenie:

In order to reason in a non-trivializing way with contradictions, paraconsistent logics reject some classically valid inferences. As a way to recover some of these inferences, Graham Priest proposed to nonmonotonically strengthen the Logic of Paradox by allowing the selection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied to contradictory assumptions. In Priest’s approach the inconsistent parts of models are compared in an e

Style APA, Harvard, Vancouver, ISO itp.

27

Kamide, Norihiro, and Yoni Zohar. "Modal extension of ideal paraconsistent four-valued logic and its subsystem." Annals of Pure and Applied Logic 171, no. 10 (2020): 102830. http://dx.doi.org/10.1016/j.apal.2020.102830.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Slaney, John. "On a Suggested Logic for Paraconsistent Mathematics." Australasian Journal of Logic 22, no. 1 (2025): 1–7. https://doi.org/10.26686/ajl.v22i2.9567.

Pełny tekst źródła

Streszczenie:

The logic subDL and its quantified extension subDLQ were proposed by Badia and Weber (Dialethism and its Applications, 2019: 155-176) as a basis for developing a version of mathematics in which paradoxes are harmless. In the present paper, subDL as defined in the literature is shown to be too strong to support the theories which motivate it. The crucial point is that contraction is derivable in subDL. It follows that the semantic structure used by Badia and Weber to invalidate contraction is not, in fact, a model of subDL. Here we identify the axioms responsible for contraction in subDL and pr

Style APA, Harvard, Vancouver, ISO itp.

29

Iakovleva, Varvara. "Penalty Logic: Paraconsistency and Applications." Логико-философские штудии, no. 1 (September 15, 2021): 110–11. http://dx.doi.org/10.52119/lphs.2021.34.37.007.

Pełny tekst źródła

Streszczenie:

Penalty logic is a non-classical non-monotonic logic which allows us to demonstrate the power of belief, the level of truth or the reliability of data that we are using. This logic can be useful to model human reasoning or to replace the penalty function in the sphere of Machine Learning. We can also talk about paraconsistency of this logic and suggest the definition of contradiction without negation.

Style APA, Harvard, Vancouver, ISO itp.

30

LÖWE, BENEDIKT, and SOURAV TARAFDER. "GENERALIZED ALGEBRA-VALUED MODELS OF SET THEORY." Review of Symbolic Logic 8, no. 1 (2015): 192–205. http://dx.doi.org/10.1017/s175502031400046x.

Pełny tekst źródła

Streszczenie:

AbstractWe generalize the construction of lattice-valued models of set theory due to Takeuti, Titani, Kozawa and Ozawa to a wider class of algebras and show that this yields a model of a paraconsistent logic that validates all axioms of the negation-free fragment of Zermelo-Fraenkel set theory.

Style APA, Harvard, Vancouver, ISO itp.

31

López Astorga, Miguel. "Jaina logic: a model-based analysis of the seven predications." Círculo de Lingüística Aplicada a la Comunicación 95 (September 18, 2023): 207–14. http://dx.doi.org/10.5209/clac.77136.

Pełny tekst źródła

Streszczenie:

A relevant part of Jainism is its logic. Jaina logic gives tools to communicate and argue. However, it is problematic from the western perspective: it seems to be a paraconsistent system, that is, a system in which a fact and the denial of that very fact can be true at once. Those difficulties have been overtaken from interpretations that ignore classical standard logic and assess Jaina logic from a point of view more linked to reasoning and the real use of natural language. One of those interpretations have resorted to the theory of mental models, and that interpretation is the one the presen

Style APA, Harvard, Vancouver, ISO itp.

32

Méndez, José M., and Gemma Robles. "Strengthening Brady’s Paraconsistent 4-Valued Logic BN4 with Truth-Functional Modal Operators." Journal of Logic, Language and Information 25, no. 2 (2016): 163–89. http://dx.doi.org/10.1007/s10849-016-9237-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Da Silva Filho, João Inácio, Raphael Adamelk Bispo de Oliveira, Marcos Carneiro Rodrigues, et al. "Predictive Controller Based on Paraconsistent Annotated Logic for Synchronous Generator Excitation Control." Energies 16, no. 4 (2023): 1934. http://dx.doi.org/10.3390/en16041934.

Pełny tekst źródła

Streszczenie:

This study presents a new Model Predictive Controller (MPC), built with algorithms based on Paraconsistent Annotated Logic (PAL), with application examples in the excitation control of a synchronous generator. PAL is a non-classical evidential and propositional logic that is associated with a Hasse lattice, and which presents the property of accepting the contradiction in its foundations. In this research, the algorithm was constructed with a version of the PAL that works with two information signals in the degrees of evidence format and, therefore, is called Paraconsistent Annotated Logic wit

Style APA, Harvard, Vancouver, ISO itp.

34

Priest, Graham. "Contradiction and the Instant of Change Revisited." Vivarium 55, no. 1-3 (2017): 217–26. http://dx.doi.org/10.1163/15685349-12341337.

Pełny tekst źródła

Streszczenie:

Instantaneous changes may well be thought to give rise to contradiction. If one endorses an explosive logic, where contradictions entail everything, this is entirely unacceptable. However, if one deploys a paraconsistent logic, which keeps contradictions under control, one may give perfectly coherent and precise models of such changes. In In Contradiction the author showed how and he explored the philosophical implications of the model. Here, the author revisits the issue in the light of a recent critique by Greg Littmann.

Style APA, Harvard, Vancouver, ISO itp.

35

Sedlár, Igor, and Vít Punčochář. "From positive PDL to its non-classical extensions." Logic Journal of the IGPL 27, no. 4 (2019): 522–42. http://dx.doi.org/10.1093/jigpal/jzz017.

Pełny tekst źródła

Streszczenie:

AbstractWe provide a complete binary implicational axiomatization of the positive fragment of propositional dynamic logic (PDL). The intended application of this result are completeness proofs for non-classical extensions of positive PDL. Two examples are discussed in this article, namely, a paraconsistent extension with modal De Morgan negation and a substructural extension with the residuated operators of the non-associative Lambek calculus. Informal interpretations of these two extensions are outlined.

Style APA, Harvard, Vancouver, ISO itp.

36

Chen, Donghuo, and Jinzhao Wu. "Model Checking Temporal Aspects of Inconsistent Concurrent Systems Based on Paraconsistent Logic." Electronic Notes in Theoretical Computer Science 157, no. 1 (2006): 23–38. http://dx.doi.org/10.1016/j.entcs.2006.01.021.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Rusu, Andrei, and Elena Rusu. "On some classes of formulas in S5 which are pre-complete relative to existential expressibility." Computer Science Journal of Moldova 31, no. 3(93) (2023): 395–408. http://dx.doi.org/10.56415/csjm.v31.21.

Pełny tekst źródła

Streszczenie:

Existential expressibility for all k-valued functions was proposed by A. V. Kuznetsov and later was investigated in more details by S. S. Marchenkov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditions for a system of formulas to be closed relative to existential expressibility. As a consequence, it has been established some pre-complete as to existential expressibility classes of formulas in some finite extensions of the paraconsistent modal logic S5.

Style APA, Harvard, Vancouver, ISO itp.

38

Mario, Mauricio Conceição, Dorotéa Vilanova Garcia, João Inácio da Silva Filho, Landulfo Silveira Júnior, and Heraldo Silveira Barbuy. "Characterization and classification of numerical data patterns using Annotated Paraconsistent Logic and the effect of contradiction." Research, Society and Development 10, no. 13 (2021): e283101320830. http://dx.doi.org/10.33448/rsd-v10i13.20830.

Pełny tekst źródła

Streszczenie:

This work describes the development of a computational mathematical model that uses Annotated Paraconsistent Logic - APL and a concept derived from it, the effect of contradiction, to identify patterns in numerical data for pattern classification purposes. The APL admits paraconsistent and paracomplete logical principles, which allow the manipulation of inconsistent and contradictory data, and its use allowed the identification and quantization of the attribute related to the contradiction. To validate the model, series of Raman spectroscopies obtained after exposure of proteins, lipids and nu

Style APA, Harvard, Vancouver, ISO itp.

39

Apostoli, Peter, and Bryson Brown. "A solution to the completeness problem for weakly aggregative modal logic." Journal of Symbolic Logic 60, no. 3 (1995): 832–42. http://dx.doi.org/10.2307/2275759.

Pełny tekst źródła

Streszczenie:

We are accustomed to regarding K as the weakest modal logic admitting of a relational semantics in the style made popular by Kripke. However, in a series of papers which demonstrates a startling connection between modal logic and the theory of paraconsistent inference, Ray Jennings and Peter Schotch have developed a generalized relational frame theory which articulates an infinite hierarchy of sublogics of K, each expressing a species of “weakly aggregative necessity”. Recall that K is axiomatized, in the presence of N and RM, by the schema of “binary aggregation”For each n ≥ 1, the weakly agg

Style APA, Harvard, Vancouver, ISO itp.

40

Banerjee, Mohua. "Logic for Rough Truth." Fundamenta Informaticae 71, no. 2-3 (2006): 139–51. https://doi.org/10.3233/fun-2006-712-301.

Pełny tekst źródła

Streszczenie:

Pawlak had proposed the notion of rough truth in 1987 [16]. The article takes a fresh look at this "soft" truth, and presents a formal system L _R , that is shown to be sound and complete with respect to a semantics determined by this notion. L _R is based on the modal logic S5. Notable is the rough consequence relation defining L _R (a first version introduced in [9]), and rough consistency (also introduced in [9]), used to prove the completeness result. The former is defined in order to be able to derive roughly true propositions from roughly true premisses in an information system. The moti

Style APA, Harvard, Vancouver, ISO itp.

41

Da Silva Filho, João Inácio. "Undulatory Theory with Paraconsistent Logic (Part I): Quantum Logical Model with Two Wave Functions." Journal of Quantum Information Science 06, no. 03 (2016): 143–80. http://dx.doi.org/10.4236/jqis.2016.63012.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

K., Veerasamy, and E. J. Thomson Fredrik. "Intelligent Farming based on Uncertainty Expert System with Butterfly Optimization Algorithm for Crop Recommendation." Journal of Internet Services and Information Security 13, no. 4 (2023): 158–69. http://dx.doi.org/10.58346/jisis.2023.i4.011.

Pełny tekst źródła

Streszczenie:

Meeting the current population's food demands has become challenging, given the rising population, frequent climate fluctuations, and limited resources. Smart farming, also known as precision agriculture, has emerged as an advanced approach to tackle modern challenges in crop production. At the heart of this cutting-edge technology is machine learning, serving as the driving force behind its implementation. Though, there are many algorithms are available in crop prediction process, the problem of predicting vague information is still a challenging issue. Unfortunately, existing algorithms most

Style APA, Harvard, Vancouver, ISO itp.

43

Abasiofon, Umoren. "THE DIALECTICAL RECONCILIATION OF RELIGIOUS CONTRADICTIONS THROUGH PARACONSISTENT LOGIC: RETHINKING FAITH IN AN AGE OF GLOBAL INTERCONNECTIVITY." International Journal of Social Science and Humanities Research 13, no. 1 (2025): 34–50. https://doi.org/10.5281/zenodo.14638506.

Pełny tekst źródła

Streszczenie:

<strong>Abstract:</strong><em> </em>In this essay, I critically engaged with the paradoxical relationship between the forces of globalization and variegated religious ideologies. The 21<sup>st</sup> century has witnessed the inexorable forces of globalization which not only precipitates profound existential convergence, but also frames an interconnected world and dissolving conventional boundaries of politics, geography, regionalism and nationalism. Thus, it is incontrovertible that the forces of globalization have created a hyper-connected world. While this has fostered intercultural and cros

Style APA, Harvard, Vancouver, ISO itp.

44

Dos Santos, Denis Medeiros, João Inácio da Silva Filho, Carlos Teofilo Salinas Sedano, and Mauricio Conceição Mario. "Desenvolvimento de um Modelo em Lógica Paraconsistente para Monitoração de Bombas Centrifugas durante a Operação de uma Refinaria de Petróleo / Development of a Paraconsistent Logic Model for Monitoring Centrifugal Pumps during the Operation of an Oil Refinery." Brazilian Journal of Development 7, no. 12 (2021): 118653–73. http://dx.doi.org/10.34117//bjdv7n12-568.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Guryanov, Ilya. "Paracelsus'; theories of ‘plague’ epidemics: current state of research." ΣΧΟΛΗ Ancient Philosophy and the Classical Tradition XVIII, no. 2 (2024): 888–925. http://dx.doi.org/10.25205/1995-4328-2024-18-2-888-925.

Pełny tekst źródła

Streszczenie:

The positivist-oriented historiography of medical history based on the idea of “progress” has bequeathed us with a legacy of perceiving Paracelsus as a great reformer of sixteenth-century medical theory and practice, heralding modern “science”. This model has been subjected to scathing critique by the intellectual history of medicine. Relying on historical and philological methods, this approach have illuminated the semantic gaps between “Paracelsianism” and Paracelsus' own doctrines. In consonance with intellectual history of medicine, recent years have witnessed a trend towards a more pronou

Style APA, Harvard, Vancouver, ISO itp.

46

Zamberlan, Miguel Fabrício, and Carolina Yukari Veludo Watanabe. "The adoption of an indicator panel in educational management to decision-making support." International Journal for Innovation Education and Research 8, no. 6 (2020): 266–90. http://dx.doi.org/10.31686/ijier.vol8.iss6.2411.

Pełny tekst źródła

Streszczenie:

The use of technology to assist in the performance of daily activities and to carry out communication between individuals has become a necessary task in the face of technological advances. In the context of public institutions, the insertion of technology is also based on the possibilities of making the activities of this sector more efficient and better quality, in addition to allowing greater transparency and accessibility of information for society. For public managers, the information and communication technology tools allow for a more accurate assessment of the variables and possibilities

Style APA, Harvard, Vancouver, ISO itp.

47

Mruczek-Nasieniewska, Krystyna, Yaroslav Petrukhin, and Vasilyi Shangin. "On Paracomplete Versions of Jaśkowski's Discussive Logic." Bulletin of the Section of Logic, January 4, 2024. http://dx.doi.org/10.18778/0138-0680.2024.01.

Pełny tekst źródła

Streszczenie:

Jaśkowski's discussive (discursive) logic D2 is historically one of the first paraconsistent logics, i.e., logics which 'tolerate' contradictions. Following Jaśkowski's idea to define his discussive logic by means of the modal logic S5 via special translation functions between discussive and modal languages, and supporting at the same time the tradition of paracomplete logics being the counterpart of paraconsistent ones, we present a paracomplete discussive logic D2p.

Style APA, Harvard, Vancouver, ISO itp.

48

CARNIELLI, WALTER, MARCELO E. CONIGLIO, and DAVID FUENMAYOR. "LOGICS OF FORMAL INCONSISTENCY ENRICHED WITH REPLACEMENT: AN ALGEBRAIC AND MODAL ACCOUNT." Review of Symbolic Logic, July 2, 2021, 1–36. http://dx.doi.org/10.1017/s1755020321000277.

Pełny tekst źródła

Streszczenie:

Abstract It is customary to expect from a logical system that it can be algebraizable, in the sense that an algebraic companion of the deductive machinery can always be found. Since the inception of da Costa’s paraconsistent calculi, algebraic equivalents for such systems have been sought. It is known, however, that these systems are not self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok–Pigozzi. The same negative results hold for several systems of the hierarchy of paraconsistent logics known as Logics of Form

Style APA, Harvard, Vancouver, ISO itp.

49

Ramos, Jaime, João Rasga, and Cristina Sernadas. "Labelled proof systems for existential reasoning." Logic Journal of the IGPL, January 30, 2024. http://dx.doi.org/10.1093/jigpal/jzad030.

Pełny tekst źródła

Streszczenie:

Abstract Usually in logic, proof systems are defined having in mind proving properties like validity and semantic consequence. It seems worthwhile to address the problem of having proof systems where satisfiability is a primitive notion in the sense that a formal derivation means that a finite set of formulas is satisfiable. Moreover, it would be useful to cover within the same framework as many logics as possible. We consider Kripke semantics where the properties of the constructors are provided by valuation constraints as the common ground of those logics. This includes for instance intuitio

Style APA, Harvard, Vancouver, ISO itp.

50

Degauquier, Vincent. "Useful Four-Valued Extension of the Temporal Logic KtT4." Bulletin of the Section of Logic 47, no. 1 (2018). http://dx.doi.org/10.18778/0138-0680.47.1.02.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!