Paraconsistent Computational Logic

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

View graph of relations

In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study.
Original languageEnglish
Title of host publication8th Scandinavian Logic Symposium : Abstracts
EditorsPatrick Blackburn, Klaus Frovin Jørgensen, Neil Jones, Erik Palmgren
Publication date2012
Pages59-61
StatePublished - 2012
Event8th Scandinavian Logic Symposium - Roskilde, Denmark

Conference

Conference8th Scandinavian Logic Symposium
LocationRoskilde University
CountryDenmark
CityRoskilde
Period20/08/201221/08/2012
Internet address
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 51497092