649 research outputs found
UMSL Bulletin 2023-2024
The 2023-2024 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1088/thumbnail.jp
Polynomial time and dependent types
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one, based on the LFPL system of Martin Hofmann, that controls construction via a payment method. Both of these are extended to full dependent types via Quantitative Type Theory, allowing for arbitrary computation in types alongside guaranteed polynomial time computation in terms. We prove the soundness of the systems using a realisability technique due to Dal Lago and Hofmann. Our long-term goal is to combine the extensional reasoning of type theory with intensional reasoning about the resources intrinsically consumed by programs. This paper is a step along this path, which we hope will lead both to practical systems for reasoning about programs’ resource usage, and to theoretical use as a form of synthetic computational complexity theory
UMSL Bulletin 2022-2023
The 2022-2023 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1087/thumbnail.jp
gaps as derived models and correctness of mice
Assume ZF + AD + V=L(R). Let be a gap with
admissible. We analyze as a natural form of
``derived model'' of a premouse , where is found in a generic extension
of . In particular, we will have , and if ``
exists'', then and in fact have the same universe. This
analysis will be employed in further work, yet to appear, toward a resolution
of a conjecture of Rudominer and Steel on the nature of , for
-small mice . We also establish some preliminary work toward this
conjecture in the present paper.Comment: 128 page
An Expressivist Strategy to Understand Logical Forms
This paper discusses a generalization of logical expressivism. It is shown that, in the wide sense defined here, the expressivist approach is neutral with respect to different theories of inference and offers a natural framework for understanding logical forms and their function. An expressivist strategy for explaining the development of logical forms is then applied to the analysis of Frege’s Begriffsschrift, Gentzen’s sequent calculus and Belnap’s display logic
Complex systems methods characterizing nonlinear processes in the near-Earth electromagnetic environment: recent advances and open challenges
Learning from successful applications of methods originating in statistical mechanics, complex systems science, or information theory in one scientific field (e.g., atmospheric physics or climatology) can provide important insights or conceptual ideas for other areas (e.g., space sciences) or even stimulate new research questions and approaches. For instance, quantification and attribution of dynamical complexity in output time series of nonlinear dynamical systems is a key challenge across scientific disciplines. Especially in the field of space physics, an early and accurate detection of characteristic dissimilarity between normal and abnormal states (e.g., pre-storm activity vs. magnetic storms) has the potential to vastly improve space weather diagnosis and, consequently, the mitigation of space weather hazards.
This review provides a systematic overview on existing nonlinear dynamical systems-based methodologies along with key results of their previous applications in a space physics context, which particularly illustrates how complementary modern complex systems approaches have recently shaped our understanding of nonlinear magnetospheric variability. The rising number of corresponding studies demonstrates that the multiplicity of nonlinear time series analysis methods developed during the last decades offers great potentials for uncovering relevant yet complex processes interlinking different geospace subsystems, variables and spatiotemporal scales
Categorical structures for deduction
We begin by introducing categorized judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and first-order logic as special kinds of categorized judgemental theories. We believe our analysis sheds light on both the topics, providing a new point of view. In the case of type theory, we provide an abstract definition of type constructor featuring the usual formation, introduction, elimination and computation rules. For first-order logic we offer a deep analysis of structural rules, describing some of their properties, and putting them into context.
We then put one of the main constructions introduced, namely that of categorized judgemental dependent type theories, to the test: we frame it in the general context of categorical models for dependent types, describe a few examples, study its properties, and use it to model subtyping and as a tool to prove intrinsic properties hidden in other models.
Somehow orthogonally, then, we show a different side as to how categories can help the study of deductive systems: we transport a known model from set-based categories to enriched categories, and use the information naturally encoded into it to describe a theory of fuzzy types. We recover structural rules, observe new phenomena, and study different possible enrichments and their interpretation. We open the discussion to include different takes on the topic of definitional equality
Recommended from our members
A homotopical description of Deligne–Mumford compactifications
In this thesis I will give a description of the Deligne–Mumford properad expressing it as the result of homotopically trivializing S¹ families of annuli (with appropriate compatibility conditions) in the properad of smooth Riemann surfaces with parameterized boundaries. This gives an analog of the results of Drummond-Cole and Oancea–Vaintrob in the setting of properads. We also discuss a variation of this trivialization which gives rise to a new partial compactification of Riemann surfaces relevant to the study of operations on symplectic cohomology
An Expressivist Strategy to Understand Logical Forms
This paper discusses a generalization of logical expressivism. It is shown that, in the wide sense defined here, the expressivist approach is neutral with respect to different theories of inference and offers a natural framework for understanding logical forms and their function. An expressivist strategy for explaining the development of logical forms is then applied to the analysis of Frege’s Begriffsschrift, Gentzen’s sequent calculus and Belnap’s display logic
- …