We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized (...) with formal grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable (...) proof-theoretic properties from its associated labelled calculus. (shrink)

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting (...) to embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the (...) context of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input. (shrink)

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates (...) the semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

An important lesson that philosophy can learn from the Turing Test and computer science more generally concerns the careful use of the method of Levels of Abstraction (LoA). In this paper, the method is first briefly summarised. The constituents of the method are “observables”, collected together and moderated by predicates restraining their “behaviour”. The resulting collection of sets of observables is called a “gradient of abstractions” and it formalises the minimum consistency conditions that the chosen abstractions must satisfy. Two useful (...) kinds of gradient of abstraction – disjoint and nested – are identified. It is then argued that in any discrete (as distinct from analogue) domain of discourse, a complex phenomenon may be explicated in terms of simple approximations organised together in a gradient of abstractions. Thus, the method replaces, for discrete disciplines, the differential and integral calculus, which form the basis for understanding the complex analogue phenomena of science and engineering. The result formalises an approach that is rather common in computer science but has hitherto found little application in philosophy. So the philosophical value of the method is demonstrated by showing how making the LoA of discourse explicit can be fruitful for phenomenological and conceptual analysis. To this end, the method is applied to the Turing Test, the concept of agenthood, the definition of emergence, the notion of artificial life, quantum observation and decidable observation. It is hoped that this treatment will promote the use of the method in certain areas of the humanities and especially in philosophy. (shrink)

This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...) realism. In Chapter I, I present an argument of his to the effect that logico-metaphysical structure provides the only good explanation of the semantic determinacy of the logical constants. I argue that other explanations are possible. In Chapter II, I present another argument of his to the effect that logico-metaphysical structure is something that comes along with ontological realism: the view that there is a non-language-relative fact of the matter about what exists. I argue that the connection between logical and ontological realism is not as close as Sider makes it out to be. -/- In the second part of this thesis (Chapters III – V) I set out a positive view of the logical constants that can explain both why their meanings are semantically determinate, and why they form part of our vocabulary. On that view, the primary bearers of logical structure are propositional attitudes, and the logical constants are in our language as vehicles for the expression of logically complex propositional attitudes. In Chapter III, I set out an expressivist theory of propositional logic. In Chapter IV, I use this theory to explain how the logical connectives end up having determinate meanings. In Chapter V, I extend the expressivist theory to predicate logic. (shrink)

General Introduction: In [1] a Calculus of Qualia (CQ) was proposed. The key idea is that, for example, blackness is radically different than █. The former term, “blackness” refers to or is about a quale, whereas the latter term, “█” instantiates a quale in the reader’s mind and is non-referential; it does not even refer to itself. The meaning and behavior of these terms is radically different. All of philosophy, from Plato through Descartes through Chalmers, including hieroglyphics and emojis, (...) used referential terms up until CQ. This paper in this series of papers addresses the question of why is there something rather than nothing, at length, and gives a radical new answer. It has to do with the fact in CQ that, while blackness is contingently possible, █ is necessarily actual, as it was in this sentence. (shrink)

General Introduction: In [1] a Calculus of Qualia (CQ) was proposed. The key idea is that, for example, blackness is radically different than █. The former term, “blackness” refers to or is about a quale, whereas the latter term, “█” instantiates a quale in the reader’s mind and is non-referential; it does not even refer to itself. The meaning and behavior of these terms is radically different. All of philosophy, from Plato through Descartes through Chalmers, including hieroglyphics and emojis, (...) used referential terms up until CQ. This paper in this series of papers includes a relatively short but comprehensive discussion with the AI Claude 3.5 Sonnet on how the CQ impacts various theories of consciousness, including Materialism, Dualism, Idealism, and 14 others. (shrink)

The authors propose a nested dissection approach to finding a fundamental cycle basis in a planar graph. The cycle basis corresponds to a fundamental null-space basis of the adjacency matrix. This problem is meant to model sparse null-space basis computations occurring in a variety of settings. An O(n3/2) bound is achieved on the nullspace basis size (i.e., the number of nonzero entries in the basis), and an O(n log n) bound on the size in the special case of grid (...) graphs. (shrink)

The derivative is a basic concept of differential calculus. However, if we calculate the derivative as change in distance over change in time, the result at any instant is 0/0, which seems meaningless. Hence, Newton and Leibniz used the limit to determine the derivative. Their method is valid in practice, but it is not easy to intuitively accept. Thus, this article describes the novel method of differential calculus based on the double contradiction, which is easier to accept intuitively. (...) Next, the geometrical meaning of the double contradiction is considered as follows. A tangent at a point on a convex curve is iterated. Then, the slope of the tangent at the point is sandwiched by two kinds of lines. The first kind of line crosses the curve at the original point and a point to the right of it. The second kind of line crosses the curve at the original point and a point to the left of it. Then, the double contradiction can be applied, and the slope of the tangent is determined as a single value. Finally, the meaning of this method for the foundation of mathematics is considered. We reflect on Dehaene’s notion that the foundation of mathematics is based on the intuitions, which evolve independently. Hence, there may be gaps between intuitions. In fact, the Ancient Greeks identified inconsistency between arithmetic and geometry. However, Eudoxus developed the theory of proportion, which is equivalent to the Dedekind Cut. This allows the iteration of an irrational number by rational numbers as precisely as desired. Simultaneously, we can define the irrational number by the double contradiction, although its existence is not guaranteed. Further, an area of a curved figure is iterated and defined by rectilinear figures using the double contradiction. (shrink)

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled (...) calculi, such as completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics. (shrink)

A nested mode ontology allows one to make sense of apparently contradictory Christological claims such as that Christ knows everything and there are some things Christ does not know.

In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made (...) to axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

This paper aims to address the difficulties of high school students in bridging their computational understanding with their visualization skills in understanding the notion of the limits in their calculus class. This research used a pre-experimental one-group pretest-posttest design research on 62 grade 10 students enrolled in the Science, Technology, and Engineering Program (STEP) in one of the public high schools in Zamboanga del Sur, Philippines. A series of remedial sessions were given to help them understand the function values, (...) one-sided limits, limits of a function, and its discontinuities with the aid of the GeoGebra. Results revealed that there is a significant improvement in their mathematics performance before and after the remediation, t(61) = -19.99, p<.05. The real-time feedback provided by the drawing interface of GeoGebra has provided the students the insights into how objects behave in geometrical space, bridging their understanding in locating the values shown by the computational algebraic processes. Additionally, the significant difference in the achievement reveals a large effect size (Cohen’s =2.54) which could be accounted for by the remediation using interactive activities in the GeoGebra. (shrink)

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist (...) reasoning, since they do not only internalize processes of verifcation or provability but also the dual processes in terms of falsifcation or what is called dual provability. In [Wansing, 2017] a normal form theorem for N2Int is stated, here, I want to prove a cut-elimination theorem for SC2Int, i.e., if successful, this would extend the results existing so far. (shrink)

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a (...) natural dual of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

John Venn has the “uneasy suspicion” that the stagnation in mathematical logic between J. H. Lambert and George Boole was due to Kant’s “disastrous effect on logical method,” namely the “strictest preservation [of logic] from mathematical encroachment.” Kant’s actual position is more nuanced, however. In this chapter, I tease out the nuances by examining his use of Leonhard Euler’s circles and comparing it with Euler’s own use. I do so in light of the developments in logical calculus from G. (...) W. Leibniz to Lambert and Gottfried Ploucquet. While Kant is evidently open to using mathematical tools in logic, his main concern is to clarify what mathematical tools can be used to achieve. For without such clarification, all efforts at introducing mathematical tools into logic would be blind if not complete waste of time. In the end, Kant would stress, the means provided by formal logic at best help us to express and order what we already know in some sense. No matter how much mathematical notations may enhance the precision of this function of formal logic, it does not change the fact that no truths can, strictly speaking, be revealed or established by means of those notations. (shrink)

The basic idea is to put qualia into equations (broadly understood) to get what might as well be called qualations. Qualations arguably have different truth behaviors than the analogous equations. Thus ‘black’ has a different behavior than ‘ █ ’. This is a step in the direction of a ‘calculus of qualia’. It might help clarify some issues.

The idea of this paper is to put actual qualia into equations (broadly understood) to get what might be called qualations. Qualations arguably have different meanings and truth behaviors than the analogous equations. For example, the term ‘ black ’ arguably has a different meaning and behavior than the term ‘ █ ’. This is a step in the direction of a ‘calculus of qualia’ and of expanding science to include 1st-person phenomena.

This paper examines systematically which features of a life story (or history) make it good for the subject herself - not aesthetically or morally good, but prudentially good. The tentative narrative calculus presented claims that the prudential narrative value of an event is a function of the extent to which it contributes to her concurrent and non-concurrent goals, the value of those goals, and the degree to which success in reaching the goals is deserved in virtue of exercising agency. (...) The narrative value of a life is a simple sum of the values of individual events that comprise it. I claim that this view best explains and support common intuitions about the significance of the shape of a life. (shrink)

To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on pro- cedural questions. This would enable an account of Leibnizian procedures in a framework limited to FOL with a small number of additional ingredients such as the relation of infinite proximity. If, as we argue here, first order logic is indeed suitable for developing modern proxies for the inferential moves found in Leibnizian (...) infinitesimal calculus, then modern infinitesimal frameworks are more appropriate to interpreting Leibnizian infinitesimal calculus than modern Weierstrassian ones. (shrink)

Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand (...) disjunctions of existential theorems obtained by this elimination procedure. (shrink)

Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper (...) "Ein Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie"; online available at http://philpapers.org/rec/CORERE.). (shrink)

I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity (...) fails, but for good reasons. Intuitionism and classical logic can easily be recovered from the system. (shrink)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a (...) calculus for the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

Some neotropical social wasps which are associated with some vertebrates and other insects like ants, and these interactions are reported for decades, but little is known about the presence of these in the Caatinga and Atlantic Forest. This study describes the first association’s record between nests of Polybia rejecta (Fabricius) wasp and Azteca chartifex Forel ants in the transition area of the Atlantic Forest and Caatinga in Rio Grande do Norte. The observations were in a private forest in Monte Alegre, (...) from October 2009 to September 2014 through active search for colonies, use of ad libitum method, photography and collection of specimens with traceability. In the study area were found four active colonies and one abandoned of P. rejecta, all associated with nests of A. chartifex with approach of 20-30 cm. It was found that when the colony of P. rejecta was disturbed, they became aggressive towards the disturbance object, whereas the ants gathered in order to fend off a potential predators. These interactions appear to benefit wasps and ants, it is assumed that is possible that wasps attack ants’s predators, whereas the ants attack the wasps’s predators. This study corroborates the hypothesis that the association between the social wasps P. rejecta and A. chartifex ants is beneficial for both species, and probably the wasps are the most benefited, but also shows the non-exclusivity of this association for the biomes up then reported. (shrink)

Drug regulation is fraught with inductive risk. Regulators must make a prediction about whether or not an experimental pharmaceutical will be effective and relatively safe when used by typical patients, and such predictions are based on a complex, indeterminate, and incomplete evidential basis. Such inductive risk has important practical consequences. If regulators reject an experimental drug when it in fact has a favourable benefit/harm profile, then a valuable intervention is denied to the public and a company’s material interests are needlessly (...) thwarted. Conversely, if regulators approve an experimental drug when it in fact has an unfavourable benefit/harm profile, then resources are wasted, people are needlessly harmed, and other potentially more effective treatments are underutilized. Given that such regulatory decisions have these practical consequences, non-epistemic values about the relative importance of these consequences impact the way such regulatory decisions are made (similar to the analysis of laboratory studies on the toxic effects of dioxins presented in Douglas [2000]). To balance the competing demands of the pertinent non-epistemic values, regulators must perform what I call an “inductive risk calculus.” At least in the American context this inductive risk calculus is not well-managed. (shrink)

Humean reductionism about laws of nature is the view that the laws reduce to the total distribution of non-modal or categorical properties in spacetime. A worry about Humean reductionism is that it cannot motivate the characteristic modal resilience of laws under counterfactual suppositions and that it thus generates wrong verdicts about certain nested counterfactuals. In this paper, we defend Humean reductionism by motivating an account of the modal resilience of Humean laws that gets nested counterfactuals right.

A new proof style adequate for modal logics is defined from the polynomial ring calculus. The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra???Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S 5, and can be easily extended to other (...) modal logics. (shrink)

We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.

One of the premises of the argument from design is the need for the order of a designer. This premise has been explained in various ways, one of which is the calculus of probabilities. It posits that the likelihood of an ordered thing coming into existence by chance is so low that human beings consider it nearly impossible; therefore, this order requires an intelligent designer. However, some contemporary Muslim philosophers, such as Ayatollah Jawādī Āmulī, along with certain Western philosophers, (...) have contested the validity of the calculus of probabilities. They argue that the calculus of probabilities does not reveal reality but is merely practically useful. They assert that undesigned states have the same probability as designed states. In this article, I address these objections, refute them, and ultimately demonstrate the soundness of the argument from design based on the calculus of probabilities. (shrink)

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)

It is fair to say that Georg Wilhelm Friedrich Hegel's philosophy of mathematics and his interpretation of the calculus in particular have not been popular topics of conversation since the early part of the twentieth century. Changes in mathematics in the late nineteenth century, the new set-theoretical approach to understanding its foundations, and the rise of a sympathetic philosophical logic have all conspired to give prior philosophies of mathematics (including Hegel's) the untimely appearance of naïveté. The common view was (...) expressed by Bertrand Russell: -/- The great [mathematicians] of the seventeenth and eighteenth centuries were so much impressed by the results of their new methods that they did not trouble to examine their foundations. Although their arguments were fallacious, a special Providence saw to it that their conclusions were more or less true. Hegel fastened upon the obscurities in the foundations of mathematics, turned them into dialectical contradictions, and resolved them by nonsensical syntheses. . . .The resulting puzzles [of mathematics] were all cleared up during the nineteenth century, not by heroic philosophical doctrines such as that of Kant or that of Hegel, but by patient attention to detail (1956, 368–69). (shrink)

In an online, participatory class, we interpreted 'The Dream of Geese Nesting in Trees' knowing nothing of the dreamer beyond age and gender, and having none of the dreamer’s associations. Our interpretation included predictions about the dreamer. When it was complete, we asked the bringer of the dream (who had until then been mostly silent and who also gave no visual feedback to our discussion) to give us more information about the dreamer. Our main predictions were confirmed. Goslings are falling (...) on the dreamer’s head. This record is another iteration of an experiment that will be described more fully in the paper, 'The Dream of the Six-Legged Dog: An Experimental System that Tests Meaning,' soon to be published. This iteration repeats and confirms the evidence given in that paper. AUDIO RECORD OF COMPLETE CLASS: link is at top of paper you can download from this page. (shrink)

This study utilized the developmental research design to identify the least taught topics in basic calculus and design and investigate the effectiveness of a Moodle-based courseware package. Data were collected from seven basic calculus teachers and five academic administrators through survey questionnaires, interviews, and validation sheets. The quasi-experimental phase of the study used a pre-/post-test control group design with a sample of 69 students, 34 students in the experimental group and 35 students in the control group. The experimental (...) group received instruction using an asynchronous Moodle-based courseware package, while the control group received instruction through lecture notes. Results showed that the least taught topics include infinite limits, limits at infinity, and limits of trigonometric, exponential, and logarithmic functions. These topics were least taught due to time constraints, students’ capacity, scheduling, complexity, and relatability. Validation of the courseware package showed a very high validity. It was found that the use of Moodle-based courseware package and lecture notes effectively increased the students’ performance. However, one-way analysis of covariance results showed that the experimental group gained considerably greater than those in the control group. It was recommended that teachers continue to update their knowledge of different teaching methodologies to develop an encouraging and dynamic learning environment. (shrink)

Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this (...) problem by applying recent methods from sorted logics. This paper presents a tableau calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi. (shrink)

All first-order Gödel logics G_V with globalization operator based on truth value sets V C [0,1] where 0 and 1 lie in the perfect kernel of V are axiomatized by Ciabattoni’s hypersequent calculus HGIF.

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)

Previously unreported nesting associations of Yellow-Olive Flycatcher (Tolmomyias sulphurescens) (Aves: Tyrannidae) with social wasps and bees.

The purpose of this paper is to outline an alternative approach to introductory logic courses. Traditional logic courses usually focus on the method of natural deduction or introduce predicate calculus as a system. These approaches complicate the process of learning different techniques for dealing with categorical and hypothetical syllogisms such as alternate notations or alternate forms of analyzing syllogisms. The author's approach takes up observations made by Dijkstrata and assimilates them into a reasoning process based on modified notations. The (...) author's model adopts a notation that addresses the essentials of a problem while remaining easily manipulated to serve other analytic frameworks. The author also discusses the pedagogical benefits of incorporating the model into introductory logic classes for topics ranging from syllogisms to predicate calculus. Since this method emphasizes the development of a clear and manipulable notation, students can worry less about issues of translation, can spend more energy solving problems in the terms in which they are expressed, and are better able to think in abstract terms. (shrink)

This piece explores the recent diplomatic shift between the Bangladesh Nationalist Party (BNP) and India, following remarks by BNP Secretary General Mirza Fakhrul Islam Alamgir. I analyze the broader implications of this unexpected development and how it reflects deeper issues within Bangladesh’s political system, particularly the reemergence of Jamaat-e-Islami and the BNP’s strategic positioning against Awami League.

This study aimed to determine the relationship between academic performance and students’ perceptions in learning Calculus during distance learning modality. Learning Calculus is part of developing students' Mathematics skills and abilities towards enhancing STEM education in Senior High School. Thirty-five (35) STEM students were purposively sampled at a public school in Davao Region, Philippines. These students took up Pre-Calculus and Basic Calculus during pandemic. This study used a quantitative research design, particularly the descriptive-correctional method, to analyze (...) the collected data. Based on the result, the level of students’ perceptions was positive, while the level of academic performance was very satisfactory. Moreover, no significant correlation exists between students’ perceptions and academic performance in learning calculus on distance learning. This implies that students can perform well regardless of their perceptions in learning Calculus, in both Pre- Calculus and Basic Calculus. However, further assessment needs to be done in their Mathematics subjects at the Tertiary level since the modality used was not face-to-face. Appropriate action may be considered based on the assessment result, such as bridging courses or tutorial sessions. (shrink)

Application 1. The case against Materialism and Illusionism Application 2. Ineffability Application 3. Hard Problems Application 4. Knowledge Argument questions Application 5. Argument for A-theories of time Application 6. Possible qualia are necessary.

The paper is an introduction to geometric algebra and geometric calculus for those with a knowledge of undergraduate mathematics. No knowledge of physics is required. The section Further Study lists many papers available on the web.

This is the first record of nesting in the soil by the ant Camponotus sericeiventris (Guérin-Méneville, 1838), which has arboreal habit. The study was conducted in southeastern Brazil, in an ant colony located in a subterranean site. This study describes, for the first time, the ability of this arboreal species to vary its nesting site by the occupation of an unusual place in an urban environment; and this study demonstrates that this species is an interesting model for studies in urban (...) environments. (shrink)

A simple interpretation of quantity calculus is given. Quantities are described as two-place functions from objects, states or processes (or some combination of them) into numbers that satisfy the mutual measurability property. Quantity calculus is based on a notational simplification of the concept of quantity. A key element of the simplification is that we consider units to be intentionally unspecified numbers that are measures of exactly specified objects, states or processes. This interpretation of quantity calculus combines all (...) the advantages of calculating with numerical values (since the values of quantities are numbers, we can do with them everything we do with numbers) and all the advantages of calculating with standardly conceived quantities (calculus is invariant to the choice of units and has built-in dimensional analysis). This also shows that the standard metaphysics and mathematics of quantities and their magnitudes is not needed for quantity calculus. At the end of the article, arguments are given that the concept of quantity as defined here is a pivotal concept in understanding the quantitative approach to nature. As an application of this interpretation of quantity calculus, an easy proof of dimensional homogeneity of physical laws is given. (shrink)

Leibniz proposed the ‘Most Determined Path Principle’ in seventeenth century. According to it, ‘ease’ of travel is the end purpose of motion. Using this principle and his calculus method he demonstrated Snell’s Laws of reflection and refraction. This method shows that light follows extremal (local minimum or maximum) time path in going from one point to another, either directly along a straight line path or along a broken line path when it undergoes reflection or refraction at plane or spherical (...) (concave or convex) surfaces. The extremal time path avoided the criticism that Fermat’s least time path was subjected to, by Cartesians who cited examples of reflections at spherical surfaces where light took the path of longest time. Thereby it became the standard method of demonstration of Snell’s Laws. Ptolemy’s theorem is a fundamental theorem in geometry. A special case of it offers a method of finding the minimum sum of the two distances of a point from two given fixed points. We show in this paper that Leibniz’s calculus proof of Snell’s Laws violates Ptolemy’s theorem, whereby Leibniz’s proof becomes invalid. (shrink)

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

The aim of this paper is to explore the uses made of the calculus by Gilles Deleuze and G. W. F. Hegel. I show how both Deleuze and Hegel see the calculus as providing a way of thinking outside of finite representation. For Hegel, this involves attempting to show that the foundations of the calculus cannot be thought by the finite understanding, and necessitate a move to the standpoint of infinite reason. I analyse Hegel’s justification for this (...) introduction of dialectical reason by looking at his responses to Berkeley’s criticisms of the calculus. For Deleuze, instead, I show that the differential must be understood as escaping from both finite and infinite representation. By highlighting the sub-representational character of the differential in his system, I show how the differential is a key moment in Deleuze’s formulation of a transcendental empiricism. I conclude by dealing with some of the common misunderstandings that occur when Deleuze is read as endorsing a modern mathematical interpretation of the calculus. (shrink)