Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,966 matches
- 2024
- Alex Belikov:
A Simple Way to Overcome Hyperconnexivity. Stud Logica 112(1-2): 69-94 (2024) - Miguel Campercholi, Diego Vaggione:
Semisimplicity and Congruence 3-Permutabilty for Quasivarieties with Equationally Definable Principal Congruences. Stud Logica 112(3): 723-733 (2024) - Sergio A. Celani, Umberto Rivieccio:
Intuitionistic Modal Algebras. Stud Logica 112(3): 611-660 (2024) - Marcelo E. Coniglio, Abilio Rodrigues:
From Belnap-Dunn Four-Valued Logic to Six-Valued Logics of Evidence and Truth. Stud Logica 112(3): 561-606 (2024) - Luis Estrada-González, Ricardo Arturo Nicolás-Francisco:
Connexive Negation. Stud Logica 112(1-2): 511-539 (2024) - Davide Fazio, Antonio Ledda, Francesco Paoli:
Intuitionistic Logic is a Connexive Logic. Stud Logica 112(1-2): 95-139 (2024) - Davide Fazio, Sergei P. Odintsov:
An Algebraic Investigation of the Connexive Logic sfC. Stud Logica 112(1-2): 37-67 (2024) - Thomas Macaulay Ferguson:
Executability and Connexivity in an Interpretation of Griss. Stud Logica 112(1-2): 459-509 (2024) - Nikolaos Galatos:
Decidability of Lattice Equations. Stud Logica 112(3): 607-610 (2024) - Guido Gherardi, Eugenio Orlandelli, Eric Raidl:
Proof Systems for Super- Strict Implication. Stud Logica 112(1-2): 249-294 (2024) - Alessandro Giordani:
Situation-Based Connexive Logic. Stud Logica 112(1-2): 295-323 (2024) - Andrea Iacona:
Connexivity in the Logic of Reasons. Stud Logica 112(1-2): 325-342 (2024) - Tomasz Jarmuzek, Mateusz Klonowski, Piotr Kulicki:
$\varvec{Brings~It~About~That}$ Operators Decomposed with Relating Semantics. Stud Logica 112(3): 541-559 (2024) - Mateusz Klonowski, Luis Estrada-González:
Boolean Connexive Logic and Content Relationship. Stud Logica 112(1-2): 207-248 (2024) - Ryo Murai, Katsuhiko Sano:
Intuitionistic Public Announcement Logic with Distributed Knowledge. Stud Logica 112(3): 661-691 (2024) - Yuya Okawa:
Unary Interpretability Logics for Sublogics of the Interpretability Logic bfIL. Stud Logica 112(3): 693-721 (2024) - Hitoshi Omori, Andreas Kapsner:
Angell and McCall Meet Wansing. Stud Logica 112(1-2): 141-165 (2024) - Niki Pfeifer, Giuseppe Sanfilippo:
Connexive Logic, Probabilistic Default Reasoning, and Compound Conditionals. Stud Logica 112(1-2): 167-206 (2024) - Eric Raidl, Andrea Iacona, Vincenzo Crupi:
An Axiomatic System for Concessive Conditionals. Stud Logica 112(1-2): 343-363 (2024) - Hans Rott:
Difference-Making Conditionals and Connexivity. Stud Logica 112(1-2): 405-458 (2024) - Heinrich Wansing, Hitoshi Omori:
Connexive Logic, Connexivity, and Connexivism: Remarks on Terminology. Stud Logica 112(1-2): 1-35 (2024) - Xuefeng Wen:
Stalnakerian Connexive Logics. Stud Logica 112(1-2): 365-403 (2024) - 2023
- Federico G. Almiñana, Gustavo Pelaitay, William Zuluaga:
On Heyting Algebras with Negative Tense Operators. Stud Logica 111(6): 1015-1036 (2023) - Nick Bezhanishvili, Tommaso Moraschini:
Hereditarily Structurally Complete Intermediate Logics: Citkin's Theorem Via Duality. Stud Logica 111(2): 147-186 (2023) - Mirjana Borisavljevic:
The Elimination of Maximum Cuts in Linear Logic and BCK Logic. Stud Logica 111(3): 391-429 (2023) - Luca Castaldo:
Notes on Models of (Partial) Kripke-Feferman Truth. Stud Logica 111(1): 83-111 (2023) - José Luis Castiglioni, Víctor Fernández, Héctor Federico Mallea, Hernán Javier San Martín:
Sub-Hilbert Lattices. Stud Logica 111(3): 431-452 (2023) - Sergio A. Celani, Daniela Montangie:
Hilbert Algebras with Hilbert-Galois Connections. Stud Logica 111(1): 113-138 (2023) - Bozena Czernecka-Rej:
Correction to: Can Başkent, Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency, Springer International Publishing, Outstanding Contributions to Logic, Vol. 18, 2019, pp. 704+xi; ISBN 978-3-030-25367-7 (Softcover) 106.99 €, ISBN 978-3-030-25364-6 (Hardcover) 149.79 €. Stud Logica 111(1): 145-146 (2023) - Hans van Ditmarsch, Malvin Gattinger, Rahim Ramezanian:
Everyone Knows That Everyone Knows: Gossip Protocols for Super Experts. Stud Logica 111(3): 453-499 (2023)
skipping 1,936 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-31 07:38 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint