148 search results - page 25 / 30 » apal 2007 |
71
Voted
APAL
2004
14 years 9 months ago
2004
First-order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently several se...
101
click to vote
APAL
2004
14 years 9 months ago
2004
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
77
Voted
APAL
1998
14 years 9 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
81
Voted
APAL
1998
14 years 9 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
84
Voted
APAL
1999
14 years 9 months ago
1999
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...