Logic and Foundations Commons^™

Classes Of Analytic Functions Defined By Salagean Derivative Operator Associated With Neutrosophic Generalized Poisson Distribution, Soliu O. Opeyemi Okunola, Olushola Adeyemo, Sayo A. Abidemi Gbangbala, Folorunso I. Isola Akinwale

Neutrosophic Systems with Applications

This study introduces and analyses new subclasses of analytic functions by applying the Salagean derivative operator to the Neutrosophic Generalized Poisson Distribution (NGPD) series. We develop a model where the mean parameter is treated as an interval or set to account for indeterminacy in complex systems. By employing Stirling numbers of the second kind and decreasing factorials, we derive necessary and sufficient coefficient inequalities and inclusion relations for these new subclasses. Numerical results and graphical illustrations demonstrate the sensitivity of these functions to orientation and the neutrosophic parameter, providing a framework for applications in fields like medical imaging and network …

Towards Erasing The Distinction Between The Computational And Syntactic Accounts Of Scientific Theories, Timothy Luft

Theses

One of the main goals of philosophy of science is to give a proper account of scientific theories and their structure. One way that accounts of the structure of scientific theories can be distinguished is by the mathematical or logical structures that they involve. For instance, syntactic accounts of scientific theories hold that theories are axioms in a logical framework, whereas semantic accounts are more liberal in the range of mathematical and logical structures they take as pertinent to the structure of scientific theories. Paul Thagard (1988) offers a computational account of scientific theories, which holds that theories are complex …

Completeness Of Nominal Props, Samuel Balco, Alexander Kurz

Engineering Faculty Articles and Research

We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are equivalent. This equivalence is then extended to symmetric monoidal theories and nominal monoidal theories, which allows us to transfer completeness results between ordinary and nominal calculi for string diagrams.

Extending Set Functors To Generalised Metric Spaces, Adriana Balan, Alexander Kurz, Jiří Velebil

Mathematics, Physics, and Computer Science Faculty Articles and Research

For a commutative quantale V, the category V-cat can be perceived as a category of generalised metric spaces and non-expanding maps. We show that any type constructor T (formalised as an endofunctor on sets) can be extended in a canonical way to a type constructor T_V on V-cat. The proof yields methods of explicitly calculating the extension in concrete examples, which cover well-known notions such as the Pompeiu-Hausdorff metric as well as new ones.

Conceptually, this allows us to to solve the same recursive domain equation X ≅ TX in different categories (such as sets and metric spaces) and …

Logic -> Proof -> Rest, Maxwell Taylor

Senior Independent Study Theses

REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.