NEXP-completeness and Universal Hardness Results for Justification Logic

We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is hard for the Sigma 2 p class of the second level of the polynomial hierarchy - given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound for the single-agent justification logics, proven by Buss and Kuznets in 2009, thus answering one of their open questions.Comment: Shorter version has been accepted for publication by CSR 201

Inequality reversal: effects of the savings propensity and correlated returns

In the last decade, a large body of literature has been developed to explain the universal features of inequality in terms of income and wealth. By now, it is established that the distributions of income and wealth in various economies show a number of statistical regularities. There are several models to explain such static features of inequality in an unifying framework and the kinetic exchange models, in particular, provide one such framework. Here we focus on the dynamic features of inequality. In the process of development and growth, inequality in an economy in terms of income and wealth follows a particular pattern of rising in the initial stage followed by an eventual fall. This inverted U-shaped curve is known as the Kuznets Curve. We examine the possibilities of such behavior of an economy in the context of a generalized kinetic exchange model. It is shown that under some specific conditions, our model economy indeed shows inequality reversal.Comment: 15 pages, 5 figure

Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi

We have recently presented a general method of proving the fundamental logical properties of Craig and Lyndon Interpolation (IPs) by induction on derivations in a wide class of internal sequent calculi, including sequents, hypersequents, and nested sequents. Here we adapt the method to a more general external formalism of labelled sequents and provide sufficient criteria on the Kripke-frame characterization of a logic that guarantee the IPs. In particular, we show that classes of frames definable by quantifier-free Horn formulas correspond to logics with the IPs. These criteria capture the modal cube and the infinite family of transitive Geach logics

Explicit Evidence Systems with Common Knowledge

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic

Topology and Evolution of Technology Innovation Networks

The web of relations linking technological innovation can be fairly described in terms of patent citations. The resulting patent citation network provides a picture of the large-scale organization of innovations and its time evolution. Here we study the patterns of change of patents registered by the US Patent and Trademark Office (USPTO). We show that the scaling behavior exhibited by this network is consistent with a preferential attachment mechanism together with a Weibull-shaped aging term. Such attachment kernel is shared by scientific citation networks, thus indicating an universal type of mechanism linking ideas and designs and their evolution. The implications for evolutionary theory of innovation are discussed.Comment: 6 pages, 5 figures, submitted to Physical Review

Shortcuts in Stochastic Systems and Control of Biophysical Processes

The biochemical reaction networks that regulate living systems are all stochastic to varying degrees. The resulting randomness affects biological outcomes at multiple scales, from the functional states of single proteins in a cell to the evolutionary trajectory of whole populations. Controlling how the distribution of these outcomes changes over time-via external interventions like time-varying concentrations of chemical species-is a complex challenge. In this work, we show how counterdiabatic (CD) driving, first developed to control quantum systems, provides a versatile tool for steering biological processes. We develop a practical graph-theoretic framework for CD driving in discrete-state continuous-time Markov networks. Though CD driving is limited to target trajectories that are instantaneous stationary states, we show how to generalize the approach to allow for nonstationary targets and local control-where only a subset of system states is targeted. The latter is particularly useful for biological implementations where there may be only a small number of available external control knobs, insufficient for global control. We derive simple graphical criteria for when local versus global control is possible. Finally, we illustrate the formalism with global control of a genetic regulatory switch and local control in chaperone-assisted protein folding. The derived control protocols in the chaperone system closely resemble natural control strategies seen in experimental measurements of heat shock response in yeast and E. coli

A Logic of Blockchain Updates

Blockchains are distributed data structures that are used to achieve consensus in systems for cryptocurrencies (like Bitcoin) or smart contracts (like Ethereum). Although blockchains gained a lot of popularity recently, there is no logic-based model for blockchains available. We introduce BCL, a dynamic logic to reason about blockchain updates, and show that BCL is sound and complete with respect to a simple blockchain model

Occupational choice, number of entrepreneurs and output: theory and empirical evidence with Spanish data

This paper extends the (Lucas, Bell J Econ 9:508–523,1978) model of occupational choices by individuals with different skills, beyond the simple options of self-employment or wage-employment, by including a second choice for the self-employed. That is, an option to hire employees and so become self-employed with employees (SEWEs), or to be self-employed without employees (SEWNEs). We solve for the market equilibrium and examine the sensitivity of relative sizes of occupational groups, and of the level of productivity, to changes in the exogenous parameters. The results show that the positive (negative) association between number of SEWEs (SEWNEs) and productivity, observed in the Spanish data, can be explained, under certain conditions, as the result of cross-region and time differences in average skills. These findings point to the importance of distinguishing between SEWEs and SEWNEs in drawing valid conclusions concerning any link between entrepreneurship and economic development