Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/sLogica/sLogica112.bht:"
@article{DBLP:journals/sLogica/Belikov24, author = {Alex Belikov}, title = {A Simple Way to Overcome Hyperconnexivity}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {69--94}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10056-3}, doi = {10.1007/S11225-023-10056-3}, timestamp = {Sat, 27 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Belikov24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/EstradaGonzalezN24, author = {Luis Estrada{-}Gonz{\'{a}}lez and Ricardo Arturo Nicol{\'{a}}s{-}Francisco}, title = {Connexive Negation}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {511--539}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10078-x}, doi = {10.1007/S11225-023-10078-X}, timestamp = {Sun, 14 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/EstradaGonzalezN24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/FazioLP24, author = {Davide Fazio and Antonio Ledda and Francesco Paoli}, title = {Intuitionistic Logic is a Connexive Logic}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {95--139}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10044-7}, doi = {10.1007/S11225-023-10044-7}, timestamp = {Sun, 14 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/FazioLP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/FazioO24, author = {Davide Fazio and Sergei P. Odintsov}, title = {An Algebraic Investigation of the Connexive Logic sfC}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {37--67}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10057-2}, doi = {10.1007/S11225-023-10057-2}, timestamp = {Sun, 14 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/FazioO24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/Ferguson24, author = {Thomas Macaulay Ferguson}, title = {Executability and Connexivity in an Interpretation of Griss}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {459--509}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10055-4}, doi = {10.1007/S11225-023-10055-4}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Ferguson24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/GherardiOR24, author = {Guido Gherardi and Eugenio Orlandelli and Eric Raidl}, title = {Proof Systems for Super- Strict Implication}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {249--294}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10048-3}, doi = {10.1007/S11225-023-10048-3}, timestamp = {Sat, 27 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/GherardiOR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/Giordani24, author = {Alessandro Giordani}, title = {Situation-Based Connexive Logic}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {295--323}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10051-8}, doi = {10.1007/S11225-023-10051-8}, timestamp = {Sat, 27 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Giordani24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/Iacona24, author = {Andrea Iacona}, title = {Connexivity in the Logic of Reasons}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {325--342}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10041-w}, doi = {10.1007/S11225-023-10041-W}, timestamp = {Sun, 14 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Iacona24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/KlonowskiE24, author = {Mateusz Klonowski and Luis Estrada{-}Gonz{\'{a}}lez}, title = {Boolean Connexive Logic and Content Relationship}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {207--248}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10058-1}, doi = {10.1007/S11225-023-10058-1}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/KlonowskiE24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/OmoriK24, author = {Hitoshi Omori and Andreas Kapsner}, title = {Angell and McCall Meet Wansing}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {141--165}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10083-0}, doi = {10.1007/S11225-023-10083-0}, timestamp = {Sun, 14 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/OmoriK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/PfeiferS24, author = {Niki Pfeifer and Giuseppe Sanfilippo}, title = {Connexive Logic, Probabilistic Default Reasoning, and Compound Conditionals}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {167--206}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10054-5}, doi = {10.1007/S11225-023-10054-5}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/PfeiferS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/RaidlIC24, author = {Eric Raidl and Andrea Iacona and Vincenzo Crupi}, title = {An Axiomatic System for Concessive Conditionals}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {343--363}, year = {2024}, url = {https://doi.org/10.1007/s11225-022-10034-1}, doi = {10.1007/S11225-022-10034-1}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/RaidlIC24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/Rott24, author = {Hans Rott}, title = {Difference-Making Conditionals and Connexivity}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {405--458}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10071-4}, doi = {10.1007/S11225-023-10071-4}, timestamp = {Sun, 14 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Rott24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/WansingO24, author = {Heinrich Wansing and Hitoshi Omori}, title = {Connexive Logic, Connexivity, and Connexivism: Remarks on Terminology}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {1--35}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10082-1}, doi = {10.1007/S11225-023-10082-1}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/WansingO24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/Wen24, author = {Xuefeng Wen}, title = {Stalnakerian Connexive Logics}, journal = {Stud Logica}, volume = {112}, number = {1}, pages = {365--403}, year = {2024}, url = {https://doi.org/10.1007/s11225-023-10043-8}, doi = {10.1007/S11225-023-10043-8}, timestamp = {Sat, 27 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Wen24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.