The paper develops Lambda Grammars, a form of categorial grammar that, unlike other categorial formalisms, is non-directional. Linguistic signs are represented as sequences of lambda terms and are combined with the help of linear combinators.

In this paper we discuss a new perspective on the syntax-semantics interface. Semantics, in this new set-up, is not ‘read off’ from Logical Forms as in mainstream approaches to generative grammar. Nor is it assigned to syntactic proofs using a Curry-Howard correspondence as in versions of the Lambek Calculus, or read off from f-structures using Linear Logic as in Lexical-Functional Grammar (LFG, Kaplan & Bresnan [9]). All such approaches are based on the idea that syntactic objects (trees, proofs, fstructures) are (...) somehow prior and that semantics must be parasitic on those syntactic objects. We challenge this idea and develop a grammar in which syntax and semantics are treated in a strictly parallel fashion. The grammar will have many ideas in common with the (converging) frameworks of categorial grammar and LFG, but its treatment of the syntax-semantics interface is radically different. Also, although the meaning component of the grammar is a version of Montague semantics and although there are obvious affinities between Montague’s conception of grammar and the work presented here, the grammar is not compositional, in the sense that composition of meaning need not follow surface structure. (shrink)

The purpose of this article is to present several immediate consequences of the introduction of a new constant called Lambda in order to represent the object ``nothing" or ``void" into a standard set theory. The use of Lambda will appear natural thanks to its role of condition of possibility of sets. On a conceptual level, the use of Lambda leads to a legitimation of the empty set and to a redefinition of the notion of set. It lets (...) also clearly appear the distinction between the empty set, the nothing and the ur-elements. On a technical level, we introduce the notion of pre-element and we suggest a formal definition of the nothing distinct of that of the null-class. Among other results, we get a relative resolution of the anomaly of the intersection of a family free of sets and the possibility of building the empty set from ``nothing". The theory is presented with equi-consistency results . On both conceptual and technical levels, the introduction of Lambda leads to a resolution of the Russell's puzzle of the null-class. (shrink)

Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional properties. In the latter approach the denotation of a sentence determines its truth conditions and can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In this short paper, we develop a vector semantics for language based (...) on the simply typed lambda calculus. Our semantics uses techniques familiar from the truth conditional tradition and is based on a form of dynamic interpretation inspired by Heim's context updates. (shrink)

The particular subject of this article is the very first sentence of Aristotle’s Metaphysics book Lambda: what does it really mean? I would stick to the most generous sense: (Aristotelian) theoria is about substance. Indeed, it has been often held that Lambda ignores the so-called focal meaning, and shows a remarkably rough stage of Aristotle’s conception of prime philosophy. By contrast, in this light, the very incipit of Lambda appears to testify Aristotle’s concern in an ontological foundation (...) of theoretical wisdom as such, which Lambda shares with the Metaphysics “central books”, Zeta in particular, in a not less coherent and possibly more advanced form. (shrink)

It is well known that the circumflex notation used by Russell and Whitehead to form complex function names in Principia Mathematica played a role in inspiring Alonzo Church's “lambda calculus” for functional logic developed in the 1920s and 1930s. Interestingly, earlier unpublished manuscripts written by Russell between 1903–1905—surely unknown to Church—contain a more extensive anticipation of the essential details of the lambda calculus. Russell also anticipated Schönfinkel's combinatory logic approach of treating multiargument functions as functions having other functions (...) as value. Russell’s work in this regard seems to have been largely inspired by Frege’s theory of functions and “value-ranges”. This system was discarded by Russell due to his abandonment of propositional functions as genuine entities as part of a new tack for solving Russell’s paradox. In this article, I explore the genesis and demise of Russell’s early anticipation of the lambda calculus. (shrink)

We extend Barbanera and Berardi's symmetric lambda calculus [2] to second-order classical propositional logic and prove its strong normalization.

Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the vector models, (...) the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the (...) natural deduction system of Wansing's bi-intuitionistic logic 2Int, which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed lambda-calculus. I will present such a term-annotated proof system for 2Int and prove a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view. (shrink)

The emerging field of quantum mereology considers part-whole relations in quantum systems. Entangled quantum systems pose a peculiar problem in the field, since their total states are not reducible to that of their parts. While there exist several established proposals for modelling entangled systems, like monistic holism or relational holism, there is considerable unclarity, which further positions are available. Using the lambda operator and plural logic as formal tools, we review and develop conceivable models and evaluate their consistency and (...) distinctness. The main result is an exhaustive taxonomy of six distinct and precise models that both provide information about the mereological features as well as about the entangled property. The taxonomy is well-suited to serve as the basis for future systematic investigations. (shrink)

This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation . It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term (...) representing its manifestation, but also to a lambda term representing its semantics. (shrink)

The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data (...) structures, pairs of terms syntax, semantics for example. These sequences then combine with the help of simple generalizations of the usual abstraction and application operations. This theory, which I call Lambda Grammars and which is closely related to the independently formulated theory of Abstract Categorial Grammars (de Groote, 2001; de Groote, 2002), in fact is an implementation of Curry’s ideas: the level of tectogrammar is encoded by the sequences of lambda-terms and their ways of combination, while the syntactic terms in those sequences constitute the phenogrammatical level. In de Groote’s formulation of the theory, tectogrammar is the level of abstract terms, while phenogrammar is the level of object terms. (shrink)

The aim of this article is to free Aristotle's Metaphysics, especially book XII (Lambda), frome some metaphysical and theological presuppositions by detecting their inappropriate conceptual framwork, which once was progressive, but now holds an obsolete position. Ousia, being (not substance, a much later concept, construed to solve other problems than Aristotle's), stand for a question, not for an answer. Book Lambda develops a highly speculative argument for this queston. The famous noesis noeseos says that empirical being and knowledge (...) is the realization of a noetic structure (noesis), laid down in our most fundamental opinioons about being. (shrink)

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

I present and discuss three previously unpublished manuscripts written by Bertrand Russell in 1903, not included with similar manuscripts in Volume 4 of his Collected Papers. One is a one-page list of basic principles for his “functional theory” of May 1903, in which Russell partly anticipated the later Lambda Calculus. The next, catalogued under the title “Proof That No Function Takes All Values”, largely explores the status of Cantor’s proof that there is no greatest cardinal number in the variation (...) of the functional theory holding that only some but not all complexes can be analyzed into function and argument. The final manuscript, “Meaning and Denotation”, examines how his pre-1905 dis­tinction between meaning and denotation is to be understood with respect to functions and their arguments. In them, Russell seems to endorse an extensional view of functions not endorsed in other works prior to the 1920s. All three manuscripts illustrate the close connection between his work on the logical paradoxes and his work on the theory of meaning. (shrink)

As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...) many twists and turns as a thriller. At the end of the story is a new principle for designing programming languages that will guide computers into the 21st century. -/- For my money, Gentzen’s natural deduction and Church’s lambda calculus are on a par with Einstein’s relativity and Dirac’s quantum physics for elegance and insight. And the maths are a lot simpler. I want to show you the essence of these ideas. I’ll need a few symbols, but not too many, and I’ll explain as I go along. -/- To simplify, I’ll present the story as we understand it now, with some asides to fill in the history. First, I’ll introduce Gentzen’s natural deduction, a formalism for proofs. Next, I’ll introduce Church’s lambda calculus, a formalism for programs. Then I’ll explain why proofs and programs are really the same thing, and how simplifying a proof corresponds to executing a program. Finally, I’ll conclude with a look at how these principles are being applied to design a new generation of programming languages, particularly mobile code for the Internet. (shrink)

A distinction is drawn among predicates, open sentences (or open formulas), and general terms, including general-term phrases. Attaching a copula, perhaps together with an article, to a general term yields a predicate. Predicates can also be obtained through lambda-abstraction on an open sentence. The issue of designation and semantic content for each type of general expression is investigated. It is argued that the designatum of a general term is a universal, e.g., a kind, whereas the designatum of a predicate (...) is a class (or its characteristic function) and the designatum of an open sentence is a truth-value. Predicates and open sentences are therefore typically non-rigid designators. It is argued further that certain general terms, including phrases, are invariably rigid designators, whereas certain others (general definite descriptions) are typically non-rigid. Suitable semantic contents for predicates, open sentences, and general terms are proposed. Consequences for the thesis of compositionality are drawn. (shrink)

This paper argues that the theory of structured propositions is not undermined by the Russell-Myhill paradox. I develop a theory of structured propositions in which the Russell-Myhill paradox doesn't arise: the theory does not involve ramification or compromises to the underlying logic, but rather rejects common assumptions, encoded in the notation of the $\lambda$-calculus, about what properties and relations can be built. I argue that the structuralist had independent reasons to reject these underlying assumptions. The theory is given both (...) a diagrammatic representation, and a logical representation in a novel language. In the latter half of the paper I turn to some technical questions concerning the treatment of quantification, and demonstrate various equivalences between the diagrammatic and logical representations, and a fragment of the $\lambda$-calculus. (shrink)

Commentary on Aristotle's Metaphysics Lambda. It accompanies the translation of Aristotle's Metaphysics Lambda into Portuguese in the same volume of the journal.

Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a (...) seminar at Princeton in 1934. Seen in the historical context, Gödel was an important catalyst for the emergence of computability theory in the mid 1930s. (shrink)

A paradox about sets of properties is presented. The paradox, which invokes an impredicatively defined property, is formalized in a free third-order logic with lambda-abstraction, through a classically proof-theoretically valid deduction of a contradiction from a single premise to the effect that every property has a unit set. Something like a model is offered to establish that the premise is, although classically inconsistent, nevertheless consistent, so that the paradox discredits the logic employed. A resolution through the ramified theory of (...) types is considered. Finally, a general scheme that generates a family of analogous paradoxes and a generally applicable resolution are proposed. (shrink)

This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too implausible to make these arguments troubling. (...) The second reason is conditional on a substitutional interpretation of quantification over types other than that of individuals. This reason stands up to investigation: a simple-type language will not sustain such an interpretation, but a ramified-type language will. And there is evidence that Russell was tacitly inclined towards such an interpretation. A strong construal of that interpretation opens a way to make sense of Russell’s simultaneous repudiation of propositions and his willingness to quantify over them. But that way runs into trouble with Russell’s commitment to the finitude of human understanding. (shrink)

According to the standard interpretation of Einstein’s field equations, gravity consists of mass-energy curving spacetime, and an additional physical force or entity—denoted by Λ (the ‘cosmological constant’)—is responsible for the Universe’s metric-expansion. Although General Relativity’s direct predictions have been systematically confirmed, the dominant cosmological model thought to follow from it—the ΛCDM (Lambda cold dark matter) model of the Universe’s history and composition—faces considerable challenges, including various observational anomalies and experimental failures to detect dark matter, dark energy, or inflation-field candidates. (...) This paper shows that Einstein’s Equivalence Principle entails two possible physical interpretations of General Relativity’s field equations. Although the field equations facially appear to support the standard interpretation—that gravity consists of mass-energy curving spacetime—the field equations can be equivalently understood as holding that gravitational effects instead result from mass-energy accelerating the metric-expansion of a second-order spacetime fabric superimposed upon an absolute, first-order Euclidean space, resulting in the observational appearance of spacetime curvature. This alternative interpretation of relativity is shown to be empirically equivalent to the standard interpretation of relativity, albeit with a changing value for Λ (which is similar to how Λ is understood in the conception of Λ as ‘quintessence’, but in this case takes Λ to be gravity). The reconceptualization is then shown to potentially resolve major observational anomalies for the ΛCDM model, including recent observations conflicting with ΛCDM predictions, as well as failures to directly detect dark matter, dark energy, and inflation field/particle candidates. (shrink)

In recent years, apparently the Big Bang as described by the Lambda CDM-Standard Model Cosmology has become widely accepted by majority of physics and cosmology communities. Even some people have concluded that it has no serious alternative in horizon. Is that true? First, as we argued elsewhere, Big Bang story relies on singularity. In other words, when we are able to describe the observed data without invoking singularity, then Big Bang model is no longer required. Therefore, here we explore (...) a few alternative stories other than Big Bang story, which most cosmologists believe it is the nearest to Biblical account of creation. We would argue that re-reading of Genesis 1:2 will lead us to another viable story, albeit the alternative has not been developed rigorously as LCDM theories. We also briefly discuss a fluid Maxwell equations of Prof. Tsutomu Kambe based on vortex sound theory. (shrink)

Alonzo Church provided three criteria for “strict synonymy”, i.e., sameness of semantic content: Alternatives (0), (1), and (2)--in order of increasing course-grainedness of content. On (2) expressions are strictly synonymous iff they are logically equivalent. (1) is a significant improvement over (2). On (1) expressions are synonymous iff they are lambda-convertible. Even on (1), assuming the Millian account of proper names, ‘Tully admires Cicero’ is deemed synonymous with ‘Cicero is self-admiring’. On (0) expressions are strictly synonymous iff they are (...) “synonymously isomorphic” in Church’s sense. A fourth alternative, here called ‘(3)’, has been maintained by several philosophers. On (3) expressions are strictly synonymous iff they are co-intensional. In particular, sentences are strictly synonymous iff they are true with resect to the same possible worlds. This criterion’s notion of content is even more course grained than that of (2). Several objections to (3) are considered. (shrink)

Logicism is, roughly speaking, the doctrine that mathematics is fancy logic. So getting clear about the nature of logic is a necessary step in an assessment of logicism. Logic is the study of logical concepts, how they are expressed in languages, their semantic values, and the relationships between these things and the rest of our concepts, linguistic expressions, and their semantic values. A logical concept is what can be expressed by a logical constant in a language. So the question “What (...) is logic?” drives us to the question “What is a logical constant?” Though what follows contains some argument, limitations of space constrain me in large part to express my Credo on this topic with the broad brush of bold assertion and some promissory gestures. (shrink)

I. Introduzione. I.1. Un’editio minor come sfida aperta. I.2 Per una più selettiva eliminatio. II.1 Sulla storia del problema : l’eredità del XIX secolo (Brandis 1823, Christ 1885, Gercke 1892) nelle edizioni del XX (Ross 1924, Jaeger 1957). II.2. Studi recenti : la necessità di un superamento. II.3. Lo stemma di riferimento : Harlfinger (1979). II.4. L’applicazione dello stemma nel libro Alpha edito da Primavesi. II.5. La revisione dello stemma, proposta per Kappa e Lambda (2009, 2010). II.6. La reazione (...) : discussioni sul ruolo della tradizione β in Kappa e Lambda (2015). III. Una verifica dello stemma in agenda : la divisione delle due famiglie. III.1 Fra i codici β : L’Ambrosianus F 113 Sup. come codex descriptus ? (libri I-IX inc.). III.2. L’ipotesi dell’ interpositus ε e le sue implicazioni sistematiche. III.3 Allievo e maestro nel XV secolo : Matthaios Chamariotes (C) e Giorgio Scholarios, Gennadeios II (Vk). III.4. Il non liquet sulle parti inferiori dello stemma e il concetto di contaminazione. IV.1. Rivedendo lo stemma dall’interno : il problema critico degli errori-guida (Leitfehler). IV.2. Iudicium e valutazione degli errori. IV.3. Errori separativi ed errori congiuntivi secondo la Textkritik di Paul Maas. IV.4. Una verifica importante : il ruolo di γ. V. Un’ipotesi alternativa . V.1. Il testo della Metafisica nei codici poziori. V.2. Un ritorno alla sigla ". V.3. Un nuovo stemma dei codici principali della Metafisica. Appendice : una verifica sull’ipotesi γ. (shrink)

Combinatory logic (Curry and Feys 1958) is a “variable-free” alternative to the lambda calculus. The two have the same expressive power but build their expressions differently. “Variable-free” semantics is, more precisely, “free of variable binding”: it has no operation like abstraction that turns a free variable into a bound one; it uses combinators—operations on functions—instead. For the general linguistic motivation of this approach, see the works of Steedman, Szabolcsi, and Jacobson, among others. The standard view in linguistics is that (...) reflexive and personal pronouns are free variables that get bound by an antecedent through some coindexing mechanism. In variable free semantics the same task is performed by some combinator that identifies two arguments of the function it operates on (a duplicator). This combinator may be built into the lexical semantics of the pronoun, into that of the antecedent, or it may be a free-floating operation applicable to predicates or larger chunks of texts, i.e. a typeshifter. This note is concerned with the case of cross-sentential anaphora. It adopts Hepple’s and Jacobson’s interpretation of pronouns as identity maps and asks how this can be extended to the cross-sentential case, assuming the dynamic semantic view of anaphora. It first outlines the possibility of interpreting indefinites that antecede non-ccommanded pronouns as existential quantifiers enriched with a duplicator. Then it argues that it is preferable to use the duplicator as a type-shifter that applies “on the fly”. The proposal has consequences for two central ingredients of the classical dynamic semantic treatment: it does away with abstraction over assignments and with treating indefinites as inherently existentially quantified. However, cross-sentential anaphora remains a matter of binding, and the idea of propositions as context change potentials is retained. (shrink)

This work gives an extended presentation of the treatment of variable-binding operators adumbrated in [3:1993d]. Illustrative examples include elementary languages with quantifiers and lambda-equipped categorial languages. Some remarks are also offered to illustrate the philosophical import of the resulting picture. Particularly, a certain conception of logic emerges from the account: the view that logics are true theories in the model-theoretic sense, i.e. the result of selecting a certain class of models as the only “admissible” interpretation structures (for a given (...) language). (shrink)

This is a rough translation of Michael Frede's "La théorie aristotélicienne de l'intellect agent" published in 1996. This insightful paper contains an important interpretation of Aristotle's notoriously difficult theory of the active intellect from De Anima III, 5. I worked up a translation during some research and thought others might benefit from having an English translation available (I couldn't find one after a cursory internet search). It's not perfect, but it should give one a sense for Frede's argument that the (...) agent intellect is the same as the divine intellect of Metaphysics Lambda. I welcome any comments or suggestions for improvement, please email me at smurray7 [at] providence [dot] edu. (shrink)

This paper is the twin of (Duží and Jespersen, in submission), which provides a logical rule for transparent quantification into hyperprop- ositional contexts de dicto, as in: Mary believes that the Evening Star is a planet; therefore, there is a concept c such that Mary be- lieves that what c conceptualizes is a planet. Here we provide two logical rules for transparent quantification into hyperpropositional contexts de re. (As a by-product, we also offer rules for possible- world propositional contexts.) One (...) rule validates this inference: Mary believes of the Evening Star that it is a planet; therefore, there is an x such that Mary believes of x that it is a planet. The other rule validates this inference: the Evening Star is such that it is believed by Mary to be a planet; therefore, there is an x such that x is believed by Mary to be a planet. Issues unique to the de re variant include partiality and existential presupposition, sub- stitutivity of co-referential (as opposed to co-denoting or synony- mous) terms, anaphora, and active vs. passive voice. The validity of quantifying-in presupposes an extensional logic of hyperinten- sions preserving transparency and compositionality in hyperinten- sional contexts. This requires raising the bar for what qualifies as co-denotation or equivalence in extensional contexts. Our logic is Tichý’s Transparent Intensional Logic. The syntax of TIL is the typed lambda calculus; its highly expressive semantics is based on a procedural redefinition of, inter alia, functional abstraction and application. The two non-standard features we need are a hyper- intension (called Trivialization) that presents other hyperintensions and a four-place substitution function (called Sub) defined over hy- perintensions. (shrink)

The present text is the revised and corrected English translation of the book published in German by the Lang Verlag, Bern 2008. Unfortunately the text still has some minor flaws (especially in the Index Locorum) but they do not concern the main thesis or the arguments. It will still be the final version, especially considering my age. It is among the most widespread and the least questioned convictions that in Metaphysics Lambda Aristotle presents a theology which has its basis (...) in a metaphysics of substance. Doubts about theological interpretation are beginning to stir in a growing number of publications, but nevertheless the majority of research literature, compendiums and histories of philosophy argues within this frame. A closer look at the facts reveals that this conviction has no basis in the text. Quite the contrary it is based on a reception with theological interests. It arised over centuries, starting from Patristic times and the Middle Ages; it was influenced by Neoplatonic texts as the Liber de Causis or the Theologia Aristotelis, texts for a long time considered as original Aristotelian books. And, if you read not translations but the Greek text, you see that the word 'god' occurs much less than in a theological book should be. In some translations we find more occurences of that word, and especially in French, Italian, English translations some words as le Bien, l'Intelligence etc. are written with capitals to inticate that it is about god. To make it even more clear, we read often the term 'First Mover' or 'Unmoved Mover' as an other name for god, but this expression is never used by Aristotle. So the reader has the impression that Aristotle speaks continuously about god. In addition, in the present book you will find arguments which clean up with the outdated concept of substance in the Aristotelian text, a concept which was developed for quite other problems than Aristotle had, namely theolgical ones. And, if there is no substance, there is no corresponding metaphysics of substance and no theology or onto-theology. If substance, metyphysics, theology play no role in Metaphysics Lambda, what else is its content and aim? That is not so difficult to say because Aristotle says it sufficiently clear in his first sentence, περὶ οὐσίας ἡ θεωρία: our inquiry is about being; its aim is to develop the Frage nach dem Sein and to state a speculative answer: being is noesis, Sein ist Gewahren. (shrink)

Server-less computing, also known as Function as a Service (FaaS), revolutionizes cloud architecture by allowing developers to focus on code and functionality without managing underlying infrastructure. This paradigm enhances resource management efficiency by dynamically allocating resources only when needed, thus optimizing cost and performance. Server-less models, epitomized by platforms like AWS Lambda, Google Cloud Functions, and Azure Functions, provide automatic scaling and fine-grained billing, making them ideal for applications with variable workloads. While challenges such as cold start latency and (...) complex debugging exist, the benefits of server-less computing—including cost savings, simplified deployment, and accelerated innovation—make it a transformative approach in the cloud computing landscape. This paper explores the principles, benefits, challenges, and practical applications of server-less computing in modern cloud architectures, highlighting its potential to drive efficiency and innovation. (shrink)

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the verdicts, hypotheses, or conjectures of any science. In work currently in progress, we argue for the unique suitability of LF for the formalization of logic, mathematics, syntax, and semantics. The present document specifies the language and rules of (...) LF, lays out some notational conventions, and states some basic technical facts about the system. (shrink)

This article consists in two parts that are complementary and autonomous at the same time. -/- In the first one, we develop some surprising consequences of the introduction of a new constant called Lambda in order to represent the object ``nothing" or ``void" into a standard set theory. On a conceptual level, it allows to see sets in a new light and to give a legitimacy to the empty set. On a technical level, it leads to a relative resolution (...) of the anomaly of the intersection of a family free of sets. -/- In the second part, we show the interest of introducing an operator of potentiality into a standard set theory. Among other results, this operator allows to prove the existence of a hierarchy of empty sets and to propose a solution to the puzzle of "ubiquity" of the empty set. -/- Both theories are presented with equi-consistency results (model and interpretation). -/- Here is a declaration of intent : in each case, the starting point is a conceptual questionning; the technical tools come in a second time\\[0.4cm] \textbf{Keywords:} nothing, void, empty set, null-class, zero-order logic with quantifiers, potential, effective, empty set, ubiquity, hierarchy, equality, equality by the bottom, identity, identification. (shrink)

In discussions of the Aharonov-Bohm effect, Healey and Lyre have attributed reality to loops $\sigma_0$ (or hoops $[\sigma_0]$), since the electromagnetic potential $A$ is currently unmeasurable and can therefore be transformed. I argue that $[A]=[A+d\lambda]_{\lambda}$ and the hoop $[\sigma_0]$ are related by a meaningful duality, so that however one feels about $[A]$ (or any potential $A\in[A]$), it is no worse than $[\sigma_0]$ (or any loop $\sigma_0\in[\sigma_0]$): no ontological firmness is gained by retreating to the loops, which are just (...) as flimsy as the potentials. And one wonders how the unmeasurability of one entity can invest another with physical reality; would an eventual observation of $A$ dissolve $\sigma_0$, consigning it to a realm of incorporeal mathematical abstractions? The reification of loops rests on the potential's ''gauge dependence''; which in turn rests on its unmeasurability; which is too shaky and arbitrary a notion to carry so much weight. (shrink)

The main objective of this PhD Thesis is to present a method of obtaining strong normalization via natural ordinal, which is applicable to natural deduction systems and typed lambda calculus. The method includes (a) the definition of a numerical assignment that associates each derivation (or lambda term) to a natural number and (b) the proof that this assignment decreases with reductions of maximal formulas (or redex). Besides, because the numerical assignment used coincide with the length of a specific (...) sequence of reduction - the worst reduction sequence - it is the lowest upper bound on the length of reduction sequences. The main commitment of the introduced method is that it is constructive and elementary, produced only through analyzing structural and combinatorial properties of derivations and lambda terms, without appeal to any sophisticated mathematical tool. Together with the exposition of the method, it is presented a comparative study of some articles in the literature that also get strong normalization by means we can identify with the natural ordinal methods. Among them we highlight Howard[1968], which performs an ordinal analysis of Godel’s Dialectica interpretation for intuitionistic first order arithmetic. We reveal a fact about this article not noted by the author himself: a syntactic proof of strong normalization theorem for the system of typified lambda calculus λ⊃ is a consequence of its results. This would be the first strong normalization proof in the literature. (written in Portuguese). (shrink)