Sequent calculi for propositional star-free likelihood logic

We consider classical, multisuccedent intuitionistic, and intuitionistic sequent calculi for propositional likelihood logic. We prove the admissibility of structural rules and cut rule, invertibility of rules, correctness of the calculi, and completeness of the classical calculus with respect to given semantics.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 3–21, January–March, 2005.     

Effective Replaceability of the Omega—Rule for Restricted Sequents of the First–Order Linear Temporal Logic

We consider an effective replaceability of the omega–rule for the always operator in a restricted first–order linear temporal logic. This work is a continuation of two previous papers of the author where an infinitary (with the omega–rule) calculus without loop rules was constructed and founded. In the present paper, we use this calculus to construct the so–called saturated calculus consisting of four decidable deductive procedures replacing the omega–rule for the always operator.     

An epistemic model of an agent who does not reflect on reasoning processes

This paper introduces an epistemic model of a boundedly rational agent under the two assumptions that (i) the agent’s reasoning process is in accordance with the model but (ii) the agent does not reflect on these reasoning processes. For such a concept of bounded rationality a semantic interpretation by the possible world semantics of the Kripke (1963) type is no longer available because the definition of knowledge in these possible world semantics implies that the agent knows all valid statements of the model. The key to my alternative semantic approach is the extension of the method of truth tables, first introduced for the propositional logic by Wittgenstein (1922), to an epistemic logic so that I can determine the truth value of epistemic statements for all relevant truth conditions. In my syntactic approach I define an epistemic logic–consisting of the classical calculus of propositional logic plus two knowledge axioms–that does not include the inference rule of necessitation, which claims that an agent knows all theorems of the logic. As my main formal result I derive a determination theorem linking my semantic with my syntactic approach. The difference between my approach and existing knowledge models is illustrated in a game-theoretic application concerning the epistemic justification of iterative solution concepts.     

Hunting for a Smaller Convex Subdifferential

Certain useful basic results of the gradient (in the smooth case), the Clarkesubdifferential, the Michel–Penot subdifferential, which is also known asthe "small" subdifferential, and the directional derivative(in the nonsmooth case) are stated and discussed. One of the advantages ofthe Michel–Penot subdifferential is the fact that it is in general "smaller"than the Clarke subdifferential. In this paper it is shown that there existsubdifferentials which may be smaller than the Michel–Penot subdifferentialandwhich have certain useful calculus. It isfurther shown that in the case of quasidifferentiability, the Michel–Penotsubdifferential enjoys calculus whichhold for the Clarke subdifferential only in the regular case.     

A sequent calculus for logic of knowledge and past time: Completeness and decidability

We consider logic of knowledge and past time. This logic involves the discrete-time linear temporal operators next, until, weak yesterday, and since. In addition, it contains an indexed set of unary modal operators agent i knows.We consider the semantic constraint of the unique initial states for this logic. For the logic, we present a sequent calculus with a restricted cut rule. We prove the soundness and completeness of the sequent calculus presented. We prove the decidability of provability in the considered calculus as well. So, this calculus can be used as a basis for automated theorem proving. The proof method for the completeness can be used to construct complete sequent calculi with a restricted cut rule for this logic with other semantical constraints as well. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 3, pp. 427–437, July–September, 2006.     

A Sequent Calculus for Propositional Dynamic Logic for Agents

We consider propositional dynamic logic for agents. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.     

On the fractional calculus of Besicovitch function

Relationship between fractional calculus and fractal functions has been explored. Based on prior investigations dealing with certain fractal functions, fractal dimensions including Hausdorff dimension, Box dimension, K-dimension and Packing dimension is shown to be a linear function of order of fractional calculus. Both Riemann–Liouville fractional calculus and Weyl–Marchaud fractional derivative of Besicovitch function have been discussed.     

A hybrid calculus for logic <Emphasis Type="Italic">N</Emphasis><Superscript><Emphasis Type="Italic">*</Emphasis></Superscript>: residual finiteness and decidability

It is proved that logic N ^* is residually finite and decidable. A hybrid calculus for the logic is constructed based on a tabular calculus for intuitionistic logic. It is shown that the hybrid calculus is sound and complete.     

Cut elimination for S4n and K4n with the central agent axiom

We analyze the multimodal logic S4 _n with the central agent axiom. We present a Hilbert-type calculus, then derive a Gentzen-type calculus with cut, and prove a cut-elimination theorem. The work shows that it is possible to construct a cut-free Gentzen-type calculus for this logic. Moreover, it also provides analogous results for the multimodal logic K4 _n with the central agent axiom.     

A fuzzy logic for an ordinal sum t-norm

Among the class of residuated fuzzy logics, a few of them have been shown to have standard completeness both for propositional and predicate calculus, like Gödel, NM and monoidal t-norm-based logic systems. In this paper, a new residuated logic NMG, which aims at capturing the tautologies of a class of ordinal sum t-norms and their residua, is introduced and its standard completeness both for propositional calculus and for predicate calculus are proved.     

A coding method for a sequent calculus of propositional logic

The paper deals with a coding method for a sequent calculus of the propositional logic. The method is based on the sequent calculus. It allows us to determine if a formula is derivable in the calculus without constructing a derivation tree. The main advantage of the coding method is its compactness in comparison with derivation trees of the sequent calculus. The coding method can be used as a decision procedure for the propositional logic.     

Calculus of variations with fractional derivatives and fractional integrals

We prove the Euler–Lagrange fractional equations and the sufficient optimality conditions for problems of the calculus of variations with functionals containing both fractional derivatives and fractional integrals in the sense of Riemann–Liouville.     

Loop-free calculus for modal logic S4. II

In [J. Andrikonis, Loop-free calculus for modal logic S4. I, Lith. Math. J., 52(1):1–12, 2012], loop-free calculus for modal logic S4 is presented. The calculus uses several types of indexes to avoid loops and obtain termination of derivation search. Although the mentioned article proves that derivation search in the calculus is finite, the proof of soundness and completeness is omitted and, therefore, is presented in this paper. Moreover, this paper presents loop-free calculus for modal logics K4, which is obtained by modifying the calculus for S4. Finally, some remarks for programming the given calculi are offered.     

A cut-free sequent system for two-dimensional modal logic,and why it matters

The two-dimensional modal logic of Davies and Humberstone (1980) [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem.     

A Version of the Bartle–Graves Theorem for Temperate Functions

We prove a version of the Bartle–Graves theorem for temperate functions in the category of the b-spaces of L. Waelbroeck. As a consequence, we give a characterization of some spaces of functions with values in quotients which appear in L. Waelbroeck's holomorphic functional calculus.     

Stochastic Analysis of the Fractional Brownian Motion

Since the fractional Brownian motion is not a semi-martingale, the usual Ito calculus cannot be used to define a full stochastic calculus. However, in this work, we obtain the Itô formula, the Itô–Clark representation formula and the Girsanov theorem for the functionals of a fractional Brownian motion using the stochastic calculus of variations.     

Saturated calculus for Horn-like sequents of a complete class of a linear temporal first order logic

A saturated calculus for the so-called Horn-like sequents of a complete class of a linear temporal logic of the first order is described. The saturated calculus contains neither induction-like postulates nor cut-like rules. Instead of induction-like postulates the saturated calculus contains a finite set of “saturated” sequents, which (1) capture and reflect the periodic structure of inductive reasoning (i.e., a reasoning which applies induction-like postulates); (2) show that “almost nothing new” can be obtained by continuing the process of derivation of a given sequent; (3) present an explicit way of generating the so-called invariant formula in induction-like rules. The saturated calculus for Horn-like sequents allows one: (1) to prove in an obvious way the completeness of a restricted linear temporal logic of the first order; (2) to construct a computer-aided proof system for this logic; (3) to prove the decidability of this logic for logically decidable Horn-like sequents. Bibliography: 15 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 220, 1995, pp. 123–144. Translated by R. Pliuškevičius.     

Exact solutions of Stokes’ first problem for heated generalized Burgers’ fluid in a porous half-space

This work is concerned with applying the fractional calculus approach to the fundamental Stokes’ first problem of a heated Burgers’ fluid in a porous half-space. Modified Darcy's law for a Burgers’ fluid with fractional model is introduced first time. By using the Fourier sine transform and the fractional Laplace transform, exact solutions of the velocity and temperature field are obtained. The solutions for a Navier–Stokes, second grade, Maxwell, Oldroyd-B or Burgers’ fluid appear as the limiting cases of the present analysis.     

A double arity hierarchy theorem for transitive closure logic

In this paper we prove that thek-ary fragment of transitive closure logic is not contained in the extension of the (k–1)-ary fragment of partial fixed point logic by all (2k–1)-ary generalized quantifiers. As a consequence, the arity hierarchies of all the familiar forms of fixed point logic are strict simultaneously with respect to the arity of the induction predicates and the arity of generalized quantifiers.Although it is known that our theorem cannot be extended to the sublogic deterministic transitive closure logic, we show that an extension is possible when we close this logic under congruence.Supported by a grant from the University of Helsinki. This research was initiated while he was a Junior Researcher at the Academy of FinlandThis article was processed by the author using the LATEX style filepljourlm from Springer-Verlag.     

Absolute Continuity in Infinite Dimensions and Anticipating Stochastic Calculus

We generalize the change of variables formula for infinite dimensional integrals with respect to the Gaussian and exponential densities to the case of the uniform measure. The presentation of the result and its interpretation in terms of stochastic processes and anticipating stochastic calculus is unified. The expression of the Radon–Nykodim density function uses a Carleman–Fredholm determinant and a divergence operator.