Arithmetical completeness in first-order dynamic logic for concurrent programs (Q1155351): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2977/prims/1195186718 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038186075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank

Latest revision as of 13:29, 13 June 2024

scientific article
Language Label Description Also known as
English
Arithmetical completeness in first-order dynamic logic for concurrent programs
scientific article

    Statements

    Arithmetical completeness in first-order dynamic logic for concurrent programs (English)
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    arithmetical axiomatization
    0 references
    regular first-order dynamic logic
    0 references
    0 references