O Método da Prova Direta por Tablôs, by Arthur Buchsbaum and Mauricio Correia Lemes Neto.
Itatiaia, Rio de Janeiro, Brazil, 2006.
Abstract: A tableau system by direct proof for classical quantificational logic, and general conditions which a tableau system based on this method should satisfy in order to be correct and complete with respect to a given logic.
XIII Brazilian Logic Conference
Four Players Semantics for a Family of Paraconsistent
and Paracomplete Logics, by Arthur Buchsbaum.
Center of Logic, Epistemology e History of Science, State University of Campinas,
Brazil, 2003.
Abstract: A family of two players semantics demonstrate that logical connectives
concerning to negation, implication, conjunction and disjunction share a
same nature in all logics of this collection, including classical logic.
Such semantics can be extended to corresponding semantics of four players,
in which the nature of implication can be shown in a more precise way.
International Workshop on Universal Logic
Open/Closed Logics and a General Theorem of
Deduction, by Arthur Buchsbaum.
Institute of Logic, Université de Neuchâtel, Neuchâtel, Switzerland, 2003.
Abstract: A general study of forms of introduction of implication and generalization
in open and closed logics.
III World Congress on Paraconsistency
Reasoning with Plausible Scenarios, by Arthur
Buchsbaum.
Institut de Recherche en Informatique de Toulouse, Université Paul Sabatier,
Toulouse, France, 2003.
Abstract: A logic having four modalities, necessity, skeptical plausibility,
credulous plausibility and possibility, is presented, including an axiomatic
calculus and a semantics. It serves as a monotonic basis for a nonmonotonic
logic which represents some forms of conjectural reasoning of scientific
activity.
9th Workshop on Logic, Language, Information
and Computation
A Logic for Ambiguous Description, by Arthur
Buchsbaum.
Pontifical Catholic University of Rio de Janeiro, Brazil, 2002.
Abstract: A logic with a new qualifier, aiming to specify ambiguous names,
present both in mathematical discourse as in natural language, is presented,
including a sequent calculus and a semantics.
Second Principia International Symposium
Reasoning within Scientific Theories: A Logic,
by Arthur Buchsbaum.
Nucleus of Epistemology and Logic, Federal University of Santa Catarina, Florianópolis,
Brazil, 2001.
Abstract: A nonmonotonic logic, suitable for representing some forms of
reasoning present in scientific activity.
II World Congress on Paraconsistency
A Game Characterization of Paraconsistent Negation,
by Arthur Buchsbaum and Tarcisio Pequeno.
Juqueí, São Sebastião, São Paulo, Brazil, 2000.
Abstract: A game-based semantics for a paraconsistent logic.
XII Encontro Brasileiro de Lógica
Uma Classe de Lógicas Polissortidas e Seu Correspondente
Teorema de Completude, by Arthur Buchsbaum and Tarcisio Pequeno.
Itatiaia, Rio de Janeiro, Brazil, 1999.
Abstract: Alternative many-sorted logics, suitable for representing, unless
translation, certain modal logics, and a generic proof method of semantic
completeness of their corresponding axiomatic calculi.
Stanislaw Jaskowski Memorial Symposium –
Parainconsistent Logic, Logical Philosophy, Mathematics and Informatics
A New Group of Logics featuring Non Classical
Negations, by Arthur Buchsbaum and Tarcisio Pequeno.
Torun, Poland, 1998.
Abstract: A second generation of paraconsistent and/or paracomplete logics,
having recursive semantics, based on logics C1,
P1 and N1 defined
by Newton C. A. da Costa. Main results and first order extensions.
IV Encontro de Filosofia Analítica
Variação e Dependência, by Arthur Buchsbaum
and Tarcisio Pequeno.
Florianópolis, Santa Catarina, Brazil, 1997.
Abstract: A generic study of variant objects in several
types of open axiomatic calculi, aiming efficient and concise formulations
of deduction theorem.
Workshop on Logic, Language, Information
and Computation - IX Escola de Computação
New Approaches to Non Standard Negations, by
Arthur Buchsbaum and Tarcisio Pequeno.
Recife, Pernambuco, Brazil, 1994.
Abstract: A group of paraconsistent and/or paracomplete
logics with recursive semantics, descendent of logics C1,
P1 and N1, defined
by Newton C. A. da Costa.
Second International
Conference on Principles of Knowledge Repesentation and Reasoning
The Logic of Epistemic Inconsistency, by Arthur
Buchsbaum and Tarcisio Pequeno.
Cambridge, Massachusetts, USA, 1991.
Abstract: A logic formalizing epistemic inconsistency is defined, suitable
as a monotonic basis for reasoning forms dealing with multiple scenarios.
VI Simpósio Brasileiro
de Inteligência Artificial
Raciocínio Automático em Lógicas Paraconsistentes
e/ou Paracompletas, by Arthur Buchsbaum and Tarcisio Pequeno.
Rio de Janeiro, RJ, Brazil, 1989.
Abstract: Tableau systems for a family of paraconsistent and/or paracomplete
logics defined by Newton C. A. da Costa.
VIII Simpósio Latino Americano de Lógica
Matemática
Algumas Soluções de Prova Automática para Lógicas
Não Clássicas - I, by Arthur Buchsbaum and Tarcisio Pequeno.
Algumas Soluções de Prova Automática para Lógicas Não Clássicas - II, by Arthur
Buchsbaum and Tarcisio Pequeno.
João Pessoa, Paraíba, Brazil, 1989.
Abstract: The first word presented automated provers
for a family of paraconsistent and/or paracomplete logics. The second work
presented a solution for dealing, by tableaux, with equality under certain
deviant conditions.
IV Reunião de Trabalho
do Projeto ESTRA - Coletânea de Resultados de Pesquisas
Um Provador Paraconsistente, by Arthur Buchsbaum
and Tarcisio Pequeno.
São José dos Campos, São Paulo, Brazil, 1988.
Abstract: An automated theorem prover for a paraconsistent logic, the calculus
C1* of Newton C. A. da Costa, is presented.
It uses an analytical approach by tableaux. Actually two tableau systems
were specified: one with a small number of rules, and another, which is
equivalent to the former, is a system with some derived rules, from which
an implementation was done.
IX Encontro Brasileiro de Lógica
Um Provador Automático de Teoremas para a Lógica
Paraconsistente de da Costa, by Arthur Buchsbaum and Tarcisio. Pequeno
São Paulo, SP, Brazil1988.
Abstract: A tableau-based prover for the paraconsistent
calculus C1* of Newton C. A. da Costa, and the
heuristics used for acquiring its specification.
