The logic Lθ1\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathbb{L}}_\theta ^1$$\end{document} was introduced in [She12]; it is the maximal logic below Lθ,θ\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${{\mathbb{L}}_{\theta, \theta}}$$\end{document} in which a well ordering is not definable. We investigate it for θ a compact cardinal. We prove that it satisfies several parallels of classical theorems on first order logic, strengthening the thesis that it is a natural logic. In particular, two models are Lθ1\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathbb{L}}_\theta ^1$$\end{document}-equivalent iff for some ω-sequence of θ-complete ultrafilters, the iterated ultrapowers by it of those two models are isomorphic.