Towards an efficient prover for the C1 paraconsistent logic (2009)
Neto, Adolfo 
; Kaestner, Celso A. A.; Finger, Marcelo
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Workshop on Logical and Semantic Frameworks, with Applications - LSFA. Unidade: IME
Assuntos: LÓGICA FORMAL, WEB SEMÂNTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NETO, Adolfo e KAESTNER, Celso A. A. e FINGER, Marcelo. Towards an efficient prover for the C1 paraconsistent logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.11.007. Acesso em: 06 nov. 2025. , 2009APA
Neto, A., Kaestner, C. A. A., & Finger, M. (2009). Towards an efficient prover for the C1 paraconsistent logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.11.007NLM
Neto A, Kaestner CAA, Finger M. Towards an efficient prover for the C1 paraconsistent logic [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 256 87-102.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.entcs.2009.11.007Vancouver
Neto A, Kaestner CAA, Finger M. Towards an efficient prover for the C1 paraconsistent logic [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 256 87-102.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.entcs.2009.11.007
