scholarly journals Recursive models for constructive set theories

1982 ◽  
Vol 23 (2-3) ◽  
pp. 127-178 ◽  
Author(s):  
M. Beeson
Keyword(s):  
2020 ◽  
Vol 14 (16) ◽  
pp. 2310-2318
Author(s):  
Ziyun Wang ◽  
Guixiang Xu ◽  
Yan Wang ◽  
Ju H. Park ◽  
Zhicheng Ji

2002 ◽  
Vol 79 (4) ◽  
pp. 964-987 ◽  
Author(s):  
Dhavan Shah ◽  
Michael Schmierbach ◽  
Joshua Hawkins ◽  
Rodolfo Espino ◽  
Janet Donavan

Although some argue that Internet use may erode involvement in public life, the most common Internet behaviors, social communication and information searching, may actually foster social and civic participation. To examine this possibility, we test a series of non-recursive models using a national survey of nearly 3,400 respondents. Two-stage least squares regressions were performed to simultaneously test the reciprocal relationship between frequency of Internet use (i.e., hours per day) and three sets of community engagement behaviors: informal social interaction, attendance at public events, and participation in civic volunteerism (i.e., annual frequency). Time spent online has a positive relationship with public attendance and civic volunteerism. No evidence of time displacement from frequency of Internet use is observed.


Author(s):  
Markus Frohme ◽  
Bernhard Steffen

AbstractThis paper presents a compositional approach to active automata learning of Systems of Procedural Automata (SPAs), an extension of Deterministic Finite Automata (DFAs) to systems of DFAs that can mutually call each other. SPAs are of high practical relevance, as they allow one to efficiently learn intuitive recursive models of recursive programs after an easy instrumentation that makes calls and returns observable. Key to our approach is the simultaneous inference of individual DFAs for each of the involved procedures via expansion and projection: membership queries for the individual DFAs are expanded to membership queries of the entire SPA, and global counterexample traces are transformed into counterexamples for the DFAs of concerned procedures. This reduces the inference of SPAs to a simultaneous inference of the DFAs for the involved procedures for which we can utilize various existing regular learning algorithms. The inferred models are easy to understand and allow for an intuitive display of the procedural system under learning that reveals its recursive structure. We implemented the algorithm within the LearnLib framework in order to provide a ready-to-use tool for practical application which is publicly available on GitHub for experimentation.


1977 ◽  
Vol 6 (1) ◽  
Author(s):  
Wolfgang Jagodzinski ◽  
Michael Zängle

AbstractThis paper is about a causal model of role-taking recently suggested by BERTRAM and BERTRAM. The model tries to combine aspects of the cognitive-developmental approach as proposed by BRUNER, PIAGET, and WYGOTSKI,and symbolic interactionism as advocated by LINDESMITH and STRAUSS. While the selection of variables is handled rather carefully, the identification and testing procedures may be criticized in three respects: They are tautological because the same equations are used for identifying and testing the model, they are contradictory because identification procedures applicable to recursive models only are applied to a nonrecursive model, and they are fragmentary because only a few although the most important of the possible comparisons of implied and observed correlations are computed. Thus, some of the author’s major conclusions seem not to warranted by the rules of path analysis.


Author(s):  
Paolo Frasconi ◽  
Marco Gori ◽  
Alessandro Sperduti
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document