Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Tractable depth-bounded approximations to some propositional logics. Towards more realistic models of logical agents.
A Solares-Rojas - 2022 - philpapers.org
The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing
that most useful logics are idealizations in that they are either undecidable or likely to be …
that most useful logics are idealizations in that they are either undecidable or likely to be …
Finite Hilbert systems for weak Kleene logics
Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined
by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene …
by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene …
[PDF][PDF] Finite Two-Dimensional Proof Systems for Non-finitely Axiomatizable Logics.
The characterizing properties of a proof-theoretical presentation of a given logic may hang
on the choice of proof formalism, on the shape of the logical rules and of the sequents …
on the choice of proof formalism, on the shape of the logical rules and of the sequents …
[PDF][PDF] An informational approach to logic: towards more realistic models of logical agents
A Solares-Rojas, M D'Agostino - 2023 - researchgate.net
We argue for an informational view of logic according to which reasoning phenomena are
conceived as operations performed by embodied and situated agents. We maintain that …
conceived as operations performed by embodied and situated agents. We maintain that …
On the axiomatisation of non-validity: Sequent-type rejection systems and beyond
M Rinke - 2023 - repositum.tuwien.at
A rejection system is a proof calculus axiomatically characterising some class of non-valid
formulas of a logic. In contrast to the usual traditions of formalising the propagation of …
formulas of a logic. In contrast to the usual traditions of formalising the propagation of …
[PDF][PDF] Finite Hilbert Systems for Weak Kleene Logics
S Marcelino, U Rivieccio - research.rug.nl
Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined
by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene …
by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene …
[PDF][PDF] Finite and analytic proof systems for non-finitely axiomatizable logics
The characterizing properties of a proof-theoretical presentation of a given logic may hang
on the choice of proof formalism, on the shape of the logical rules and of the sequents …
on the choice of proof formalism, on the shape of the logical rules and of the sequents …
[PDF][PDF] There will be consequence
J Marcos - Organizers and Programme Committee, 2022 - academia.edu
In times of increased political polarisation, the spread of misleading information, amplified by
social media algorithms, gives rise to cognitive biases that can seriously distort the …
social media algorithms, gives rise to cognitive biases that can seriously distort the …
[IDÉZET][C] Computability of logical problems associated to partial non-deterministic matrices
PGG Filipe - 2022 - INSTITUTO SUPERIOR TECNICO