2014
DOI: 10.1016/j.scico.2013.09.007
|View full text |Cite
|
Sign up to set email alerts
|

Revising basic theorem proving algorithms to cope with the logic of partial functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…The initial concept was created by Łukasiewicz [32] and developed further by different logicians, such as Kleene [26], introducing the concept of "undefined" dealing with partial recursive functions. A similar concept has been later used by Jones et al in [4,24]. The three-valued approach is used in [25] for the definition of a new abstraction method for fully probabilistic systems and in [40] for model checking of Discrete-Time Markov Chains.…”
Section: Related Workmentioning
confidence: 99%
“…The initial concept was created by Łukasiewicz [32] and developed further by different logicians, such as Kleene [26], introducing the concept of "undefined" dealing with partial recursive functions. A similar concept has been later used by Jones et al in [4,24]. The three-valued approach is used in [25] for the definition of a new abstraction method for fully probabilistic systems and in [40] for model checking of Discrete-Time Markov Chains.…”
Section: Related Workmentioning
confidence: 99%