Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Veloso, Sheila"'
Publikováno v:
EPTCS 113, 2013, pp. 153-168
We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it re
Externí odkaz:
http://arxiv.org/abs/1303.7336
Publikováno v:
EPTCS 81, 2012, pp. 47-62
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually simpler and
Externí odkaz:
http://arxiv.org/abs/1203.6159
Publikováno v:
In Theoretical Computer Science 15 July 2017 685:83-103
Publikováno v:
In Electronic Notes in Theoretical Computer Science 11 July 2016 323:215-233
Publikováno v:
In Electronic Notes in Theoretical Computer Science 24 April 2015 312:231-252
Publikováno v:
In Electronic Notes in Theoretical Computer Science 11 July 2014 305:123-139
Publikováno v:
In Electronic Notes in Theoretical Computer Science 22 April 2011 269:125-137
Autor:
Veloso, Paulo A. S., de Freitas, Renata P., Viana, Petrucio, Benevides, Mario, Veloso, Sheila R. M.
Publikováno v:
Journal of Philosophical Logic, 2007 Oct 01. 36(5), 489-509.
Externí odkaz:
https://www.jstor.org/stable/30226902
Publikováno v:
Studia Logica: An International Journal for Symbolic Logic, 2004 Dec 01. 78(3), 459-477.
Externí odkaz:
https://www.jstor.org/stable/20016668
Autor:
de Freitas, Renata P., Viana, Jorge P., Benevides, Mario R. F., Veloso, Sheila R. M., Veloso, Paulo A. S.
Publikováno v:
Journal of Philosophical Logic, 2003 Aug 01. 32(4), 343-355.
Externí odkaz:
https://www.jstor.org/stable/30227272