Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Faculty of Engineering and Information Sciences - Papers: Part A

Calculus

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Social and Behavioral Sciences

Application Of Fractional Calculus In Modelling Ballast Deformation Under Cyclic Loading, Yifei Sun, Buddhima Indraratna, John Philip Carter, Timothy R. Marchant, Sanjay Nimbalkar Jan 2017

Application Of Fractional Calculus In Modelling Ballast Deformation Under Cyclic Loading, Yifei Sun, Buddhima Indraratna, John Philip Carter, Timothy R. Marchant, Sanjay Nimbalkar

Faculty of Engineering and Information Sciences - Papers: Part A

Most constitutive models can only simulate cumulative deformation after a limited number of cycles. However, railroad ballast usually experiences a large number of train passages that cause history-dependent long-term deformation. Fractional calculus is an efficient tool for modelling this phenomenon and therefore is incorporated into a constitutive model for predicting the cumulative deformation. The proposed model is further validated by comparing the model predictions with a series of corresponding experimental results. It is observed that the proposed model can realistically simulate the cumulative deformation of ballast from the onset of loading up to a large number of load cycles.


Completeness Of Two Systems Of Illative Combinatory Logic For First-Order Propositional And Predicate Calculus, Wil Dekkers, Martin Bunder, Henk Barendregt Jan 1998

Completeness Of Two Systems Of Illative Combinatory Logic For First-Order Propositional And Predicate Calculus, Wil Dekkers, Martin Bunder, Henk Barendregt

Faculty of Engineering and Information Sciences - Papers: Part A

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus.


Systems Of Illative Combinatory Logic Complete For First Order Propositional And Predicate Calculus, Henk Barendregt, Martin Bunder, Wil Dekkers Jan 1993

Systems Of Illative Combinatory Logic Complete For First Order Propositional And Predicate Calculus, Henk Barendregt, Martin Bunder, Wil Dekkers

Faculty of Engineering and Information Sciences - Papers: Part A

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the …