Relevant bibliographies by topics / Paraconsistent modal logics

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Paraconsistent modal logics'

Author: Grafiati
Published: 8 June 2024
Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Paraconsistent modal logics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Paraconsistent modal logics"

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:

 
 
 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
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Paraconsistent modal logics"

1

KOZHEMIACHENKO, Daniil. "Paraconsistent and fuzzy modal logics for reasoning about uncertainty." Electronic Thesis or Diss., Bourges, INSA Centre Val de Loire, 2023. http://www.theses.fr/2023ISAB0014.

Full text
Abstract:
Ce manuscrit est dédié à l'étude des logiques modales floues qui formalisent le raisonnement (paraconsistant) sur l'incertitude. Ici, l'interprétation d'«information (données) incertain(es)» inclut toute combinaison des trois propriétés suivantes. Premièrement, l'information peur être quantifiée, i.e., la proposition est associée à un degré de vérité plutôt qu'une valeur de vérité. Deuxièmement, l'information peut être incomplète. Troisièmement, l'information peut être contradictoire.Toutes les logiques étudiees se divisent en deux groupes. Les plus «traditionnelles» dont la sémantique est con
APA, Harvard, Vancouver, ISO, and other styles
2

Costa, Diana Filipa de Pinho. "Paraconsistency in hybrid logic." Master's thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/13305.

Full text
Abstract:
Mestrado em Matemática e Aplicações<br>The use of hybrid logics allows the description of relational structures, at the same time that allows establishing accessibility relations between states and, furthermore, nominating and making mention to what happens at speci c states. However, the information we collect is subject to inconsistencies, namely, the search for di erent information sources can lead us to pick up contradictions. Nowadays, by having so many means of dissemination available, that happens frequently. The aim of this work is to develop tools capable of dealing with contr
APA, Harvard, Vancouver, ISO, and other styles
3

Teles, Eugênia Ribeiro. "Uma Abordagem paraconsistente para o problema da consistência nos dilemas morais." Universidade Federal da Paraí­ba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/5619.

Full text
Abstract:
Made available in DSpace on 2015-05-14T12:11:48Z (GMT). No. of bitstreams: 1 ArquivoTotalEugenia.pdf: 1111400 bytes, checksum: 8d0150bdfd73d917028015cfe5760882 (MD5) Previous issue date: 2013-03-15<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>This work deals with the question of logical consistency inside the context of moral dilemmas or, more specifically, genuine moral dilemmas, which are situations where someone has a conflict between two obligatory actions guided by the same moral principle. In other words, it is a situation where there are two moral obligations whic
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Paraconsistent modal logics"

1

Burgess, John P. Logic and Philosophical Methodology. Edited by Herman Cappelen, Tamar Szabó Gendler, and John Hawthorne. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199668779.013.30.

Full text
Abstract:
This article explores the role of logic in philosophical methodology, as well as its application in philosophy. The discussion gives a roughly equal coverage to the seven branches of logic: elementary logic, set theory, model theory, recursion theory, proof theory, extraclassical logics, and anticlassical logics. Mathematical logic comprises set theory, model theory, recursion theory, and proof theory. Philosophical logic in the relevant sense is divided into the study of extensions of classical logic, such as modal or temporal or deontic or conditional logics, and the study of alternatives to
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Paraconsistent modal logics"

1

Kudo, Yasuo, Tetsuya Murai, and Seiki Akama. "A Review on Rough Sets and Possible World Semantics for Modal Logics." In Towards Paraconsistent Engineering. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40418-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Indrzejczak, Andrzej, and Yaroslav Petrukhin. "A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus." In Automated Deduction – CADE 29. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_19.

Full text
Abstract:
AbstractWe present a uniform characterisation of three-valued logics by means of bisequent calculus (BSC). It is a generalised form of 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. This family covers several forms of hypersequent and nested sequent calculi introduced to provide decent SC for several non-classical logics. It seems that for many non-classical logics, including some many-valued, paraconsistent and modal logics, this reasonably modest generalization of standard SC is sufficient. In this paper we examine a variety of three-valued logics and show how they can be formalised in the framework of bisequent calculus. All provided systems are cut-free and satisfy the subformula property. Also the interpolation theorem is constructively proved for some logics.
APA, Harvard, Vancouver, ISO, and other styles
3

Besnard, Philippe, and Paul Wong. "Modal (Logic) Paraconsistency." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45062-7_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bílková, Marta, Sabine Frittella, and Daniil Kozhemiachenko. "Paraconsistent Gödel Modal Logic." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_26.

Full text
Abstract:
AbstractWe introduce a paraconsistent modal logic $$\mathbf {K}\mathsf {G}^2$$ K G 2 , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation $$\lnot $$ ¬ . We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of $$\mathbf {K}\mathsf {G}^2$$ K G 2 is two-dimensional: we interpret $$\mathbf {K}\mathsf {G}^2$$ K G 2 on crisp frames with two valuations $$v_1$$ v 1 and $$v_2$$ v 2 , connected via $$\lnot $$ ¬ , that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second) valuation encodes the positive (resp., negative) information the state gives to a statement. We obtain that $$\mathbf {K}\mathsf {G}^2$$ K G 2 is strictly more expressive than the classical modal logic $$\mathbf {K}$$ K by proving that finitely branching frames are definable and by establishing a faithful embedding of $$\mathbf {K}$$ K into $$\mathbf {K}\mathsf {G}^2$$ K G 2 . We also construct a constraint tableau calculus for $$\mathbf {K}\mathsf {G}^2$$ K G 2 over finitely branching frames, establish its decidability and provide a complexity evaluation.
APA, Harvard, Vancouver, ISO, and other styles
5

Nasieniewski, Marek, and Andrzej Pietruszczak. "On Modal Logics Defining Jaśkowski’s D2-Consequence." In Paraconsistency: Logic and Applications. Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-4438-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Damásio, Carlos Viegas, and Luís Moniz Pereira. "A model theory for paraconsistent logic programming." In Progress in Artificial Intelligence. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60428-6_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sedlár, Igor, and Ondrej Majer. "Modelling Sources of Inconsistent Information in Paraconsistent Modal Logic." In New Essays on Belnap-­Dunn Logic. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31136-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jayakumar, Badrinath, and Rajshekhar Sunderraman. "Description Logic Programs: A Paraconsistent Relational Model Approach." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27060-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Başkent, Can. "Public Announcements and Inconsistencies: For a Paraconsistent Topological Model." In Logic, Epistemology, and the Unity of Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26506-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tarafder, Sourav. "Ordinals in an Algebra-Valued Model of a Paraconsistent Set Theory." In Logic and Its Applications. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-45824-2_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Paraconsistent modal logics"

1

Kamide, Norihiro, and Yoni Zohar. "Finite Model Property for Modal Ideal Paraconsistent Four-Valued Logic." In 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2019. http://dx.doi.org/10.1109/ismvl.2019.00029.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yan, Fei, Huanguo Zhang, Lina Wang, and Min Yang. "An improved intrusion detection model based on paraconsistent logic." In Asia-Pacific Optical Communications, edited by S. J. Ben Yoo, Gee-Kung Chang, Guangcheng Li, and Kwok-wai Cheung. SPIE, 2005. http://dx.doi.org/10.1117/12.574963.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kirilo, Caique Z., Jair M. Abe, Marcelo Nogueira, Kazumi Nakamatsu, Luiz Carlos Machi Lozano, and Luiz A. de Lima. "Evaluation Of Adherence To The Model Six Sigma Using Paraconsistent Logic." In 2018 Innovations in Intelligent Systems and Applications (INISTA). IEEE, 2018. http://dx.doi.org/10.1109/inista.2018.8466287.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pena, Eduardo H. M., Sylvio Barbon, Joel J. P. C. Rodrigues, and Mario Lemes Proenca. "Anomaly detection using digital signature of network segment with adaptive ARIMA model and Paraconsistent Logic." In 2014 IEEE Symposium on Computers and Communication (ISCC). IEEE, 2014. http://dx.doi.org/10.1109/iscc.2014.6912503.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Porubay, Oksana. "MAKING MANAGEMENT DECISIONS OF THE ELECTRIC POWER SYSTEM USING THE PARACONSISTENCY LOGICAL MODEL OF THE EXPERT SYSTEM (PESPAL2V)." In CAD/EDA/SIMULATION IN MODERN ELECTRONICS 2021. Bryansk State Technical University, 2021. http://dx.doi.org/10.30987/conferencearticle_61c997ef1fd468.69147282.

Full text
Abstract:
This article describes an expert system that is designed and developed for a certain and limited application of human knowledge. Equipped with an information base, it is able to make decisions based on reasonable knowledge. At the same time, the algorithms from which the computational program of the expert system consist, represent knowledge from the area they should analyze and help solve problems.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Paraconsistent modal logics' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography