Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Graduate School: Course Decriptions, 1972-73

Official publication of Cornell University V.64 1972/7

Prolegomena to a Semantic Theory for Natural Languages Based on Recursive Artihmetic

In this dissertation, the possibility of employing a version of (primitive) recursive arith- metic to build the semantic representations of natural language sentences is explored. This idea derives from the fact that such a formal system differs under several respects from formalisms which have been traditionally employed in formal semantics, based on classical predicate logic. Specifically, in the case of recursive arithmetic, quantifiers are not primitive terms of the language, but they are defined as peculiar recursive functions; additionally, within it they cannot be defined in a way which corresponds to how they have traditionally been conceived, i.e. as “unbounded” quantifiers, whose domain is not necessarily finite. In recursive arithmetic, however, it is possible to convey something equivalent to general assertions, regarding any arbitrarily chosen individual, by using free variables; crucially, such variables do not establish relations of scope with other terms of the language, and their interpretation can to a large extent be assimilated to that of wide scope standard universal quantifiers. In the light of this, it is argued that several linguistic phenomena, attested in natural languages of different families, can be explained in an especially natural way by assuming that the lexical elements and syn- tactic structures involved are correlated with the presence of these free variables with generic value in the logical form of the sentence. In particular, generic indefinites, con- ditionals and habitual clauses are analyzed, in their interaction with the negation and, as for the first two, with quantified noun phrases; in connection with these aspects, the problem of the internal structure of negative indefinite is also addressed; finally, a pos- sible analysis of the Neg-Raising phenomenon in terms of generic variables is offered. Many of the proposals made here have already appeared in the literature, in Löbner (2000, 2013) and, moreover, in Goodstein (1951, 1957) and Hornstein (1984). Some apparent counterexamples to the theory outlined are explained by making appeal to an independently motivated treatment of embedded clauses. It is suggested that the analyzed phenomena, when collectively considered, confirm the validity of the initial project, letting one glimpse new potential scenarios for a fruitful exchange between the philosophy of mathematics and linguistic semantics

1976/1977 UCI General Catalogue

General catalogue for the academic year 1976-1977